Course Description

  • Computational geometry studies efficient algorithms and data structures for solving large scale geometry problems. The topics to be covered include computational complexity, convex hull, line segment intersection, Delaunay triangulation, Voronoi diagram, Euclidean shortest path, mesh generation, etc.

Lecture Hours

  • M,W,F


  1. Computational Geometry, Algorithms and Applications (3rd Ed.)
    by Mark de Berg, Otfried Cheong, Marc van Kreveld, and Mark Overmars

  2. David M. Mount's Lecture Notes:


  • Class Participation - 10%
  • Homeworks - 30%
  • Midterm exam - 30%
  • Final exam - 30%