Introduction • historical perspective • algorithmic background • geometric preliminaries • initial forays Convex hulls • problem statement and lower bounds • convex hull algorithms • convex hulls in >2 dimensions • extensions and applications
Proximity • Typical problems and lower bounds • Closest pair problem • Voronoi diagrams • Minimum spanning trees • Triangulations Miscellaneous problems • (More) Art gallery problems • Intersections • Pattern recognition • Parallel computational geometry
1. Laszlo, Computational Geometry, PHI 2. M.de Berg, Computational Geometry-algorithms & applications,Springer India