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:
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 | |||
|---|---|---|---|---|---|
CS 6366 (Overall) | |||||
A- | |||||
CS 6366 Congyi Zhang | |||||
Not teaching in Spring 2026 | |||||
CS 6366 Xiaohu Guo | |||||
A- | |||||
CS 6366 Pushpa Kumar | |||||
A | |||||
CS 6366 Kang Zhang | |||||
A- | |||||
Search Results
| Name | Grades | Rating | |||
|---|---|---|---|---|---|
CS 6366 (Overall) | |||||
A- | |||||
CS 6366 Congyi Zhang | |||||
Not teaching in Spring 2026 | |||||
CS 6366 Xiaohu Guo | |||||
A- | |||||
CS 6366 Pushpa Kumar | |||||
A | |||||
CS 6366 Kang Zhang | |||||
A- | |||||
Computer Graphics
CS 6366
Erik Jonsson School of Engineering and Computer Science
Device and logical coordinate systems. Geometric transformations in two and three dimensions. Algorithms for basic 2-D drawing primitives, such as Brensenham's algorithm for lines and circles, Bezier and B-Spline functions for curves, and line and polygon clipping algorithms. Perspectives in 3-D, and hidden-line and hidden-face elimination, such as Painter's and Z-Buffer algorithms. Fractals and the Mandelbrot set. 3 credit hours.
Prerequisites: CS 5330 and CS 5343 and MATH 2418.
Offering Frequency: Each year
Grades: 303
Median GPA: A-
Mean GPA: 3.501
Click a checkbox to add something to compare.
Computer Graphics
CS 6366
Erik Jonsson School of Engineering and Computer Science
Device and logical coordinate systems. Geometric transformations in two and three dimensions. Algorithms for basic 2-D drawing primitives, such as Brensenham's algorithm for lines and circles, Bezier and B-Spline functions for curves, and line and polygon clipping algorithms. Perspectives in 3-D, and hidden-line and hidden-face elimination, such as Painter's and Z-Buffer algorithms. Fractals and the Mandelbrot set. 3 credit hours.
Prerequisites: CS 5330 and CS 5343 and MATH 2418.
Offering Frequency: Each year
Grades: 303
Median GPA: A-
Mean GPA: 3.501
Click a checkbox to add something to compare.