Computational Geometry: Algorithms and Applications
General Information |
Miao Jin Office hours: Thursday 4:00pm - 5:00pm ACTR 237
Times & Places
TR 5:00pm - 6:15pm, ACTR 101
A range of topics related to geometric representation
and computation. We will study fundamental data structures and algorithms from computational geometry and their applications to problems that occur in practice.
Topics include (not complete):
- Introduction and convex hulls
- Line segment intersection
- Triangulating a polygon
- Planar point location
- Voronoi diagrams
- Delaunay Triangulations
- Robot Motion Planning
- Medial Axis
CMPS 341 Formal Foundations of Computer Science.
Computational Geometry, Algorithms and Applications by Mark de Berg et al
Lecture notes on Computational Geometry by David M. Mount (optional).
- 25% Assignments
- 30% Midterm exam
- 30% Final exam
- 15% One small size project
Set of Problems