Description: Computational Geometry
Curriculum
- 1 Section
- 38 Lessons
- 10 Weeks
Expand all sectionsCollapse all sections
- Computational Geometry38
- 2.1Introduction
- 2.2Visibility Problems
- 2.32D Maxima
- 2.4Line Sweep Method
- 2.5Segment Intersection Problem
- 2.6Line Sweep: Rectangle Union
- 2.7Convex Hull Part-1
- 2.8Convex Hull Part-2
- 2.9Quick Hull
- 2.10More Convex Hull Algorithms
- 2.11Intersection of Half Planes & Duality Part-1
- 2.12Intersection of Half Planes & Duality Part-2
- 2.13Lower Bounds
- 2.14Planar Point Location
- 2.15Point Location & Triangulation
- 2.16Voronoi Diagram : Properties
- 2.17Delaunay Triangulation
- 2.18Quick Sort & Backward Analysis
- 2.19Generalized RIC
- 2.20RIC
- 2.21Arrangements
- 2.22Zone Theorem & Application
- 2.23Levels
- 2.24Range Searching : Introduction
- 2.25Orthogonal Range Searching
- 2.26Priority Search Trees
- 2.27Non – Orthogonal Range Searching
- 2.28Half – Plane Range Query
- 2.29Well Separated Partitioning
- 2.30Quadtrees Epsilon -WSPD
- 2.31Construction of Epsilon – WSPD
- 2.32Epsilon – WSPD to Geometric Spanner
- 2.33Epsilon-Nets & VC Dimension Part 1
- 2.34Epsilon-Nets & VC Dimension Part 2
- 2.35Geometric Set Cover Part 1
- 2.36Geometric Set Cover Part 2
- 2.37Shape Representation
- 2.38Shape Comparison
