Computational Geometry Student Projects - 2006

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

  1. Dispersion problems
  2. Computing with origami (paper folding)
  3. Kempe's double rhomboid linkage
  4. Testing the convexity and strong visibility of a polygon
  5. Generalized Cauchy linkage
  6. Stuck unknotted hexagonal polygons in 3D
  7. Facility location
  8. Relative neighbor decomposition of a simple polygon
  9. Computing nice viewpoints of objects in space
  10. Weakly externally visible polygons
  11. The Mohr-Mascheroni theorem: constructions with compass alone
  12. Steiner's theorem on the indispensability of the compass in geometric constructions
  13. Geometric Lower bounds I: Decision trees
  14. Geometric Lower bounds II: Reduction from sorting