188 762 - Computational Geometry

1^st semester, 2009

Instructor:

Description

This graduate level course is an introductory course to computational geometry. Topics covered include line segment intersection, polygon triangulation, orthogonal range searching, point location, Voronoi diagram, Delaunay triangulation, convex hulls, binary space partitioning, and non-uniform mesh generation.

Course syllabus pdf

Course Materials

Computational Geometry: Algorithms and Applications, M. de Berg, M. van Kreveld, M. Overmars and O. Schwarzkopf.
Computational Geometry: An Introduction, F. Preparata and M. Shamos
Dave Mount's note, University of Maryland (link)

Class Time and Location

Regular program : Mon/Fri 9:00 - 10:30

Part-time program : Sat 17:00-20:00

Lecture Notes

Coming soon.