CMSC754

Computational Geometry

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.

Spring 2026

David Mount

0 reviews
Average rating: N/A

Past Semesters

David Mount

0 reviews
Average rating: N/A

David Mount

0 reviews
Average rating: N/A

Include P/F semesters During the Spring 2020 and Spring 2021 semesters, students could choose to take some of their courses pass-fail mid-semester which skews grade data aggregated across multiple semesters.

Average GPA of 3.48 between 205 students*

A-: 16.59%

A: 33.17%

A+: 11.22%

B-: 6.34%

B: 18.05%

B+: 8.78%

F: 0.49%

W: 2.93%

other: 2.44%

* "W"s are considered to be 0.0 quality points. "Other" grades are not factored into GPA calculation. Grade data not guaranteed to be correct.