• Course Number: 16:198:529
  • Semester 1: Fall
  • Credits: 3
  • Description:

    This course covers fundamental algorithmic problems associated with geometric computations, including convex hulls, polygons, Voronoi diagrams, triangulation, intersection, range queries, visibility, arrangements, and motion planning for robotics. It also covers algorithmic methods used in geometric computation such as plane sweep, incremental insertion, randomization, divide-and-conquer, etc.  Students are expected to have undergraduate level of data structures and algorithms.

  • M.S. Course Category: Algorithms & Complexity
  • Category: A (M.S.), A (Ph.D.)
  • Expected Work: Midterm, homework assignments, and a final project. Students may choose one of two tracks: theory or applied.