Goals and Typical Problems of Computational Geometry:
Goals: development of algorithms and data structures for the manipulation
of discrete geometric objects in two- and higher-dimensional space.
Typical problems: intersection and union of polygons and polyhedra,
computation of convex hulls, point location, neighborhood structures,
routing in the presence of obstacles, etc.
Detailed Topics:
We shall cover most of the material in the first 12 chapters of the text,
pretty much following the text.
I'll add material on randomized algorithms for various tasks along the way,
and discuss multidimensional generalizations.
Project:
Using CGAL if desired, you will code up something of particular
interest to you; you should communicate your choice to me no later than
the beginning of October.
leaving you at least 8 weeks for coding things up, debugging them, and writing
a short report/presentation. I would encourage you to familiarize yourselves
with the libraries right away.