## Computational Geometry

Computational Geometry. Instructor: Prof. Pankaj Aggarwal, Department of Computer Science and Engineering, IIT Delhi. This course covers lessons in Introduction using Basic Visibility Problems, The Maximal Points Problem, The Plane Sweep Technique and applications, Convex Hull Different Paradigms and Quickhull, Dual Transformation and Applications, Lower Bounds on Algebraic Tree Model, Point Location and Triangulation, Voronoi Diagram and Delaunay Triangulation, Randomized Incremental Construction and Random Sampling, Arrangements and Levels, Range Searching, Clustering Point Sets using Quadtrees and Applications, Epsilon-Nets VC Dimension and Applications, Shape Analysis and Shape Comparison.
(from **nptel.ac.in**)

Lecture 13 - Lower Bounds |

Go to **the Course Home** or watch other lectures: