**Computational Geometry Student
Projects - 2002**

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

- Envelopes of arrangements of lines
- Unimodal distance functions in computational geometry
- Remove Degeneracies I: No two points on a vertical line
- Remove Degeneracies II: No three points on a vertical plane
- Remove Degeneracies III: No two points with the same coordinates
- Chirality of molecules
- Lower Bounds I: Decision trees
- Lower Bounds II: Reduction from sorting
- Range Searching via Locus Method
- Convexifying Monotonic Linkages
- Convexifying Star-Shaped Linkages
- The Bellows Conjecture
- Polymer Physics
- Weakly externally visible polygons
- Filling polyhedral molds
- The diameter of point sets with minkowski metrics
- The space of line-segment transversals
- Five-Coloring planar graphs
- Hamiltonian circuits in dense graphs
- Eulerian circuits in connected graphs
- Travelling salesman problem heuristics
- Computing with Origami (paper folding)
- Computing with a Rusted Compass
- The Mohr-Mascheroni Theorem: constructions with compass alone
- Steiner's theorem on the indispensability of the compass in geometric constructions