Folding and Unfolding in Computational Geometry
Part III: Polyhedra
Last Update:
All material in these pages is Copyright 2006 by Erik D. Demaine and Joseph O'Rourke.
Note: The contents list below is out-of-date w.r.t. the final contents,
for which see TOC.
- Introduction and Overview
- Overview
- Curvature
- Gaus-Bonnet Theorem
- Edge Unfolding of Polyhedra
- Introduction
- Evidence For Edge Unfoldings
- Evidence Against Edge Unfoldings
- Ununfoldable Polyhedra
- Special Classes of Edge-Unfoldable Polyhedra
- Vertex Unfoldings
- Reconstruction of Polyhedra
- Minkowski's Theorem
- Cauchy's Rigidity Theorem
- Flexible Polyhedra
- Alexsandrov's Theorem
- Sabitov's Algorithm
- Shortest Paths
- Shortest Paths Algorithms
- Star Unfolding
- Geodesics:Lyusternik-Schnirelmann
- Curve Developement
- Folding Polygons to Polyhedra
- Folding a Polygon
- Exponential Number of Gluing Trees
- General Gluing Algorithm
- The Foldings of the Latin Cross
- The Foldings of a Square to Convex Polyhedra
- Reconstructing 3D Shapes
- Enumerations of Foldings
- Enumerations of Cuttings
- Orthogonal Polyhedra
- Unfolding in Higher Dimensions