CS 5160 - Computational Geometry

Meets with CS 6160. Study of algorithms for geometric objects (points, lines, surfaces). Topics include: convex hulls, Voronoi diagrams and Delaunay Triangulations, range searching, nearest neighbors, all in low and high dimension. Geometric duality, linear programing, path planning. may include some of: geometric approximations and core sets, VC-dimension, basic meshing and geometry processing.