**Computational
Geometry Student
Projects - 2006**

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

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