Computational Geometry

Course content

Introduction to algorithms and data structures for geometric problems in two and three dimensions. Convex hull; triangulations and planar subdivisions; geometric search and intersection; Voronoi diagrams; Delaunay triangulations; line arrangements; visibility.