Spring Quarter '01-'02
The course is a graduate-level introduction to basic techniques used in the design and analysis of efficient geometric algorithms, including: convexity, triangulation, sweeping, spatial partitioning, and point location. Arrangements and Voronoi/Delaunay diagrams will be discussed in detail, with emphasis on recent developments using random sampling methods. The course will also cover intersection, visibility, and range searching problems. The focus will be on data structures of general usefulness in geometric computing and the conceptual primitives appropriate for manipulating them. The impact of numerical issues in geometric computation will be addressed. Applications to meshing, motion planning, visibility preprocessing, model-based recognition, molecular modeling, and geographical information systems will be used throughout to motivate the material.
Students in the course can choose between a theoretical and an applied track. The difference will be in some of the homeworks. The assignments in the theory track will emphasize the mathematical aspects and the analysis techniques; those in the applied track will focus on data structure and implementation issues.
A good undergraduate course in algorithms, such as CS161 here at Stanford, is useful preparation. Students in the applied track should have some implementation experience with C/C++.
Time: Mo/We 9:30 -- 10:45 am
Location: Gates 100
Instructor: Leonidas Guibas
TA: Olaf Hall-Holt
These pages are maintained by Leonidas Guibas email@example.com.
Last update April 2, 2002