CMSC 754
Computational Geometry
Introduction to algorithms and data structures for computational problems in discrete geometry (for points, lines, and polygons) primarily in two and three dimensions. Topics include triangulations and planar subdivisions, geometric search and intersection, convex hulls, Voronoi diagrams, Delaunay triangulations, line arrangements, visibility, and motion planning.
Topics
- triangulations and planar subdivisions
- geometric search and intersection
- convex hulls
- Voronoi diagrams
- Delaunay triangulations
- line arrangements
- visibility
- and motion planning
Topics explicitly listed in official catalogue description
Prerequisites & course information
Additional Information: Students must have prior coursework similar to the content offered in undergraduate courses CMSC451 and CMSC420 .
Sources
- Course catalogue ↗2026-2027