CMSC 754

Computational Geometry

3credits
About this course

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.

All available terms

5 terms

Avg. GPA
3.65
Grades
194

Other grades

W4.1%
More course details

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 distribution

GradeStudentsPercent
A+2814.4%
A5628.9%
A-3417.5%
B+147.2%
B2613.4%
B-105.2%
W84.1%

Based on 194 student grade records across 5 terms and 3 professors.

Instructors

Related courses

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