Completed
Mod-08 Lec-19 Delaunay Triangulation.
Class Central Classrooms beta
YouTube videos curated by Class Central.
Classroom Contents
Computational Geometry
Automatically move to the next video in the Classroom when playback concludes
- 1 Mod-01 Lec-01 Introduction
- 2 Mod-01 Lec-02 Visibility Problems
- 3 Mod-02 Lec-03 2D Maxima
- 4 Mod-03 Lec-04 Line Sweep Method
- 5 Mod-03 Lec-05 Segment Intersection Problem
- 6 Mod-03 Lec-06 Line Sweep: Rectangle Union
- 7 Mod-04 Lec-07 Convex Hull
- 8 Mod-04 Lec-08 Convex Hull Contd
- 9 Mod-04 Lec-09 Quick Hull
- 10 Mod-04 Lec-10 More Convex Hull Algorithms
- 11 Mod-05 Lec-11 Intersection of Half Planes and Duality
- 12 Mod-05 Lec-12 Intersection of Half Planes and Duality Contd
- 13 Mod-06 Lec-13 Lower Bounds
- 14 Mod-07 Lec-14 Planar Point Location
- 15 Mod-07 Lec-15 Point Location and Triangulation Contd...
- 16 Triangulation of Arbitrary Polygon.
- 17 Mod-08 Lec-17 Voronoi Diagram : Properties
- 18 Mod - 08 Lec-18 Voronoi Diagram Construction
- 19 Mod-08 Lec-19 Delaunay Triangulation.
- 20 Mod-09 Lec-20 Quick sort and Backward Analysis
- 21 Mod-09 Lec-21 Generalized RIC
- 22 Mod-09 Lec-22 RIC Continued
- 23 Mod-10 Lec-23 Arrangements
- 24 Mod-10 Lec-24 Zone Theorem and Application
- 25 Mod-10 Lec-25 Levels
- 26 Mod-11 Lec-26 Range Searching : Introduction
- 27 Mod-11 Lec-27 Orthogonal Range searching
- 28 Mod-11 Lec-28 Priority Search Trees
- 29 Mod-11 Lec-29 Non - Orthogonal Range Searching
- 30 Mod-11 Lec-30 Half - Plane Range Query
- 31 Mod-12 Lec-31 Well Separated Partitioning
- 32 Mod-12 Lec-32 Quadtrees Epsilon -WSPD
- 33 Mod-12 Lec-33 Construction of Epsilon - WSPD
- 34 Mod-12 Lec-34 Epsilon - WSPD to Geometric Spanner
- 35 Mod-13 Lec-35 Epsilon-Nets & VC Dimension
- 36 Mod-13 Lec-36 Epsilon-Nets & VC Dimension contd
- 37 Mod-13 Lec-37 Geometric Set Cover
- 38 Mod-13 Lec-38 Geometric Set Cover (with Bounded VC Dimension)
- 39 Mod-14 Lec-39 Shape Representation
- 40 Mod-14 Lec-40 Shape Comparison
