Princeton University
Computer Science Dept.

Computer Science 451
Computational Geometry

Bernard Chazelle

Spring 1998

General Information | Schedule and Readings | Links | What's New?

This course introduces the basic concepts of geometric computing, illustrating the importance of this field for a variety of applications areas, such as computer graphics, solid modeling, robotics, database, pattern recognition, and statistical analysis. Algorithms are presented and analyzed for a large number of geometric problems, and an array of fundamental techniques are discussed (e.g., convex hulls, Voronoi diagrams, intersectio problems, multidimensional searching).
Prerequisites: 226 and 341

General Information

Lectures: MW at 1:30--2:50
Professor: Bernard Chazelle chazelle@cs