Skip to content
HOME
FAQ
ABOUT
Expand
About Company
Vision and Mission
Our Team
Privacy Policy
Terms of Use
CONTACT
SMART HEALTH
Expand
Online Health Assistance from Indian Doctors and Specialist . Live Video Consultation
BUY NOW
LOGIN
Register
Live Assistance
Toggle Menu
Home
Courses
Engineering
Computational Geometry
Curriculum
1 Section
38 Lessons
10 Weeks
Expand all sections
Collapse all sections
Computational Geometry
38
2.1
Introduction
2.2
Visibility Problems
2.3
2D Maxima
2.4
Line Sweep Method
2.5
Segment Intersection Problem
2.6
Line Sweep: Rectangle Union
2.7
Convex Hull Part-1
2.8
Convex Hull Part-2
2.9
Quick Hull
2.10
More Convex Hull Algorithms
2.11
Intersection of Half Planes & Duality Part-1
2.12
Intersection of Half Planes & Duality Part-2
2.13
Lower Bounds
2.14
Planar Point Location
2.15
Point Location & Triangulation
2.16
Voronoi Diagram : Properties
2.17
Delaunay Triangulation
2.18
Quick Sort & Backward Analysis
2.19
Generalized RIC
2.20
RIC
2.21
Arrangements
2.22
Zone Theorem & Application
2.23
Levels
2.24
Range Searching : Introduction
2.25
Orthogonal Range Searching
2.26
Priority Search Trees
2.27
Non – Orthogonal Range Searching
2.28
Half – Plane Range Query
2.29
Well Separated Partitioning
2.30
Quadtrees Epsilon -WSPD
2.31
Construction of Epsilon – WSPD
2.32
Epsilon – WSPD to Geometric Spanner
2.33
Epsilon-Nets & VC Dimension Part 1
2.34
Epsilon-Nets & VC Dimension Part 2
2.35
Geometric Set Cover Part 1
2.36
Geometric Set Cover Part 2
2.37
Shape Representation
2.38
Shape Comparison
This content is protected, please
login
and
enroll
in the course to view this content!
HOME
FAQ
ABOUT
Toggle child menu
Expand
About Company
Vision and Mission
Our Team
Privacy Policy
Terms of Use
CONTACT
SMART HEALTH
Toggle child menu
Expand
Online Health Assistance from Indian Doctors and Specialist . Live Video Consultation
BUY NOW
LOGIN
Register