Computational Geometry

Geometry stops being something you draw and starts being something you compute: this graduate-level course is about designing algorithms and data structures that handle points, polygons, and polyhedra efficiently, with provable bounds rather than visual intuition. You'll work through four homework sets, a midterm and final, and a term project where you implement and present a nontrivial geometric algorithm, drawing on classics like Graham's scan, divide-and-conquer closest-pair, Voronoi diagrams, and Delaunay triangulation. It assumes you're already comfortable with algorithm analysis and data structures, and the techniques here underpin graphics, robotics, GIS, and CAD — anywhere spatial data needs to be queried or processed at scale.