|
STUDENT NAME |
YEAR |
THESIS TITLE |
|
Suzanne Gallagher |
2003 |
Coloring objects built from bricks |
| Nadia Benbernou |
2006 |
Fixed-angle polygonal chains: Locked chains and the maximum span |
|
Suzanne Gallagher |
2003 |
Coloring objects built from bricks |
|
Beenish Chaudry |
2003 |
Double gluing graphs and the discrete sliding conjecture |
|
Geetika Tewari |
2002 |
Partitioning orthogonal polygons into fat rectangles |
|
Octavia Petrovici |
2001 |
Trapping light rays with mirrors |
|
Biliana
Kaneva |
2000 |
An implementation of Chen & Han's
shortest paths algorithm |
|
Roxana
Cocan |
1999 |
Polygonal chains cannot lock in
4D |
|
Anna
Lysysanskya |
1997 |
Constructing a simple closed geodesic
on a polytope |
|
Amy Josefczyk |
1996 |
Morphing polyhedra from 4D representations |
|
Chen Xiao |
1996 |
Morphing orthogonal polygons |
|
Dianna Xu |
1996 |
Shortest paths on polytopes |
|
(Eszter Hargittai) |
1996 |
Holes in the 'Net: The Internet and
International Stratification
|
|
(Amy Hoff ) |
1995 |
Armchairs with wings: A psychology
of thought
experimentation |
|
Carole Gitlin |
1993 |
Three-dimensional reconstruction
from slices |
|
Michelle Maurer |
1993 |
Geodesics on nested polytopes |
|
Jennifer Rippel |
1992 |
Segment visibility graphs |
|
Anu Dhagat |
1992 |
Motion planning with movable obstacles |
|
Vinita
Subramanian |
1991 |
Reconstruction
of Polyhedra from Slices |
|
Kristin McCown |
1991 |
Succint Representations of Orthogonal
Polyhedra |
|
Susan Jones(Dorward) |
1990 |
Local Motion Planning Algorithms |
|
Julie DiBiase |
1990 |
Polytope Unfolding |
|
Stacia Wyman
|
1990 |
Geodesics on Polytopes |