Computational geometry studies how to compute with and reason about geometric objects. The subject is playing an increasingly important role in computer graphics, game software, geometric modeling, geographic information systems, and many other applications. Course topics include convex hull, segment manipulations, triangulations, range searching, Voronoi diagrams, window queries, Delaunay triangulation, duality. Some key algorithms are implemented. Questions of floating-point accuracy and robust algorithm design are considered throughout the course.

Usually Offered:	Fall In 2002-03, Fall
Credit:	3 hours (class)
Prerequisite:	CS 580 or consent of instructor
University Catalog:	CS 531
Schedule:	Fall 2002 Instructor: Elisha Sacks
Syllabi:	Canonical