**Computational
Geometry
Student Projects - 1999**

*"I hear and I forget. I see
and I remember. I do and I understand."* - Confucius

- Largest Empty Circle Problem - David Boileau and Charles Godin
- Geodesic Paths Inside Polygons - Sung Soo Kang and Simon Mak
- The Four-Bar Linkage - Andrew Jackson and Peter Toth
- Rigidity of Polyhedra - Jonathan Shum
- Protein Folding - Brian Kudlow and Guillaume Marceau
- Convex Hull of an Arrangement of Lines - Irina Landman and Rodrigo Mora
- Computing Maximum Distances Between Sets - Herb McKaig
- Computing Minimum Distances Between Sets - Francis Cardinal and Patrick Cardinal
- Polygonizing Sets of Line Segments in the Plane - Raphael Pascual-Leone and Christian Schmidt
- The Three-Coins Algorithm for Convex Hulls of Polygons - Greg Aloupis and Bohdan Kaluzny
- Computing Location Depth - Sebastian Mrosovsky