IIT Delhi · Computer Science
Computational Geometry
Prof. Amit Kumar · 40 free video lectures
40 video lectures. Topics: Introduction; Visibility Problems; 2D Maxima; Line Sweep Method; Segment Intersection Problem; Line Sweep: Rectangle Union; Convex Hull; Convex Hull Contd; Quick Hull; More Convex Hull Algorithms; Intersection of Half Planes and Duality; Intersection of Half Planes and…
▶ Play on Open Lecture HallCourse page ↗
Lectures
- Introduction
- Visibility Problems
- 2D Maxima
- Line Sweep Method
- Segment Intersection Problem
- Line Sweep: Rectangle Union
- Convex Hull
- Convex Hull Contd
- Quick Hull
- More Convex Hull Algorithms
- Intersection of Half Planes and Duality
- Intersection of Half Planes and Duality Contd
- Lower Bounds
- Planar Point Location
- Point Location and Triangulation Contd...
- Triangulation of Arbitrary Polygon.
- Voronoi Diagram : Properties
- Voronoi Diagram Construction
- Delaunay Triangulation.
- Quick sort and Backward Analysis
- Generalized RIC
- RIC Continued
- Arrangements
- Zone Theorem and Application
- Levels
- Range Searching : Introduction
- Orthogonal Range searching
- Priority Search Trees
- Non - Orthogonal Range Searching
- Half - Plane Range Query
- Well Separated Partitioning
- Quadtrees Epsilon -WSPD
- Construction of Epsilon - WSPD
- Epsilon - WSPD to Geometric Spanner
- Epsilon-Nets & VC Dimension
- Epsilon-Nets & VC Dimension contd
- Geometric Set Cover
- Geometric Set Cover (with Bounded VC Dimension)
- Shape Representation
- Shape Comparison
From NPTEL (IITs and IISc) · CC BY-NC-SA. More from IIT Delhi.
Open Lecture Hall is free, with no ads and no sign-up. It is not run by or connected to any university; the lectures are the universities' own free recordings, played from where they host them. About & rights