Computational Geometry

Overview Contents: Introduction using basic visibility problems : Introduction,Visibility problems 2D Maxima - The plane sweep technique and applications - The plane sweep technique and application - 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 - E-nets VC dimension and applications - Shape analysis and shape comparison