Hide Advanced Options
Courses - Fall 2023
Computer Science Department Site
Computational Geometry
Credits: 3
Grad Meth: Reg, Aud
Prerequisite: CMSC451 and CMSC420; or permission of instructor.
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.