My PlannerExplore and compare past grades, professor ratings, and reviews to find the perfect class.
Grades:
Median GPA:
Mean GPA:
Search Results
| Name | Grades | Rating |
|---|---|---|
A+ | ||
A+ | ||
A+ | ||
A+ | ||
A+ | ||
A+ | ||
A+ | ||
A+ | ||
A+ | ||
A+ | ||
A+ | ||
A+ | ||
A+ | ||
A+ | ||
A+ | ||
A+ | ||
A+ | ||
A+ | ||
A+ | ||
A+ | ||
Grades:
Median GPA:
Mean GPA:
5.0
Professor rating
5.0
Difficulty
1,000
Ratings given
99%
Would take again
Visit Rate My Professors
Grades:
Median GPA:
Mean GPA:
Search Results
| Name | Grades | Rating |
|---|---|---|
A+ | ||
A+ | ||
A+ | ||
A+ | ||
A+ | ||
A+ | ||
A+ | ||
A+ | ||
A+ | ||
A+ | ||
A+ | ||
A+ | ||
A+ | ||
A+ | ||
A+ | ||
A+ | ||
A+ | ||
A+ | ||
A+ | ||
A+ | ||
Search Results
| Name | Grades | Rating |
|---|---|---|
A+ | ||
A+ | ||
A+ | ||
A+ | ||
A+ | ||
A+ | ||
A+ | ||
A+ | ||
A+ | ||
A+ | ||
A+ | ||
A+ | ||
A+ | ||
A+ | ||
A+ | ||
A+ | ||
A+ | ||
A+ | ||
A+ | ||
A+ | ||
Search Results
| Name | Grades | Rating |
|---|---|---|
A+ | ||
A+ | ||
A+ | ||
A+ | ||
A+ | ||
A+ | ||
A+ | ||
A+ | ||
A+ | ||
A+ | ||
A+ | ||
A+ | ||
A+ | ||
A+ | ||
A+ | ||
A+ | ||
A+ | ||
A+ | ||
A+ | ||
A+ | ||
Search Results
| Name | Grades | Rating | |||
|---|---|---|---|---|---|
Not teaching in Spring 2026 | |||||
CS 6319 Emily Fox | |||||
A- | |||||
Search Results
| Name | Grades | Rating | |||
|---|---|---|---|---|---|
Not teaching in Spring 2026 | |||||
CS 6319 Emily Fox | |||||
A- | |||||
Grades: 725
Median GPA: B+
Mean GPA: 3.179
5
Professor rating
3.6
Difficulty
15
Ratings given
100%
Would take again
Computational Geometry
Erik Jonsson School of Engineering and Computer Science
This course will cover basic computational geometry topics, such as computing convex hulls, computing Voronoi diagrams and Delaunay triangulations, motion planning, and the main methods for developing geometric algorithms. We will also discuss various geometric data structures for point location and range searching and additional topics at the discretion of the instructor, such as geometric approximation and high dimensional data analysis. 3 credit hours.
Prerequisite: CS 5343.
Offering Frequency: Based on student interest and instructor availability
Grades: 128
Median GPA: A-
Mean GPA: 3.628
Click a checkbox to add something to compare.
Grades: 725
Median GPA: B+
Mean GPA: 3.179
5
Professor rating
3.6
Difficulty
15
Ratings given
100%
Would take again
Computational Geometry
Erik Jonsson School of Engineering and Computer Science
This course will cover basic computational geometry topics, such as computing convex hulls, computing Voronoi diagrams and Delaunay triangulations, motion planning, and the main methods for developing geometric algorithms. We will also discuss various geometric data structures for point location and range searching and additional topics at the discretion of the instructor, such as geometric approximation and high dimensional data analysis. 3 credit hours.
Prerequisite: CS 5343.
Offering Frequency: Based on student interest and instructor availability
Grades: 128
Median GPA: A-
Mean GPA: 3.628
Click a checkbox to add something to compare.