Course ID
009883
Course Description
The study of algorithms for geometric objects, using a computational geometry approach, with an emphasis on applications for graphics, VLSI, GIS, robotics, and sensor networks. Topics may include the representation and overlaying of maps, finding nearest neighbors, solving linear programming problems, and searching geometric databases. Graduate-level requirements include reading a paper in the field of computational geometry or related literature and discussing this paper with the instructor.
Min Units
3
Max Units
3
Repeatable for Credit
No
Grading Basis
GRD - Regular Grades A, B, C, D, E
Career
Graduate
Course Requisites
May be convened with
CSC437
Component
Lecture
Optional Component
No