Computational Geometry

Catalog description

The goal of computational geometry is to find efficient algorithms for solving geometric problems. Topics include convex hulls, Voronoi diagrams, Delaunay triangulations, geometric search and geometric data structures. Students not able to register due to the restrictions may contact the department for permission.