Computational Geometry Student Projects - 1999

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

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