This is an introductory course on computational geometry and its applications. We will discuss techniques needed in designing and analyzing efficient algorithms and data structures for computational problems in discrete geometry, such as convex hulls, geometric intersections, geometric structures such as Voronoi diagrams and Delaunay triangulations, arrangements of lines and hyperplanes, and range searching.

For further information, please see the course syllabus.

General Information

Class Time Tue, Thu 9:30-10:45am
CSIC 3120
Instructor Dave Mount
Office AVW 3373  
Office Hours Stop in anytime for short questions. To arrange a specific time, please send me email.
Teaching Assistant Guilherme Fonseca
Office Hours Please send email to arrange a meeting.


Check here periodically for important announcements.

Course Finished:

The course is finished for the semester. I enjoyed teaching it very much! I hope that you found it a valuable experience.

Old announcements can be found in the Archive.