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.
5 terms
Other grades
University of Maryland
CMSC 754 at UMD: average GPA 3.65 across 194 students. Grade distribution by term. Introduction to algorithms and data structures for computational problems in…
Average GPA: 3.65
Grade distribution records: 194 students across 5 terms.
| Grade | Students | Percent |
|---|---|---|
| A+ | 28 | 14.4% |
| A | 56 | 28.9% |
| A- | 34 | 17.5% |
| B+ | 14 | 7.2% |
| B | 26 | 13.4% |
| B- | 10 | 5.2% |
| W | 8 | 4.1% |
Based on 194 student grade records across 5 terms and 3 professors.
Related topic in CMSC
Related topic in CMSC
Related topic in CMSC
Also in CMSC
Also in CMSC
Also in CMSC
The course page is taking longer to load. This summary is still available.
We could not load the full course details. This summary is still available.
Still loading. This can take a moment on a slow connection.
Loading My Class Grades