We explore which polyhedra and polyhedral complexes can be formed by folding up a planar polygonal region and fastening it with one zipper. We call the reverse process a zipper unfolding. A zipper unfolding of a polyhedron is a path cut that unfolds the polyhedron to a planar polygon; in the case of edge cuts, these are Hamiltonian unfoldings as introduced by Shephard in 1975. We show that all Platonic and Archimedean solids have Hamiltonian unfoldings. We give examples of polyhedral complexes that are, and are not, zipper [edge] unfoldable. The positive examples include a polyhedral torus, and two tetrahedra joined at an edge or at a face.
[1]
Robert Friedel,et al.
Zipper: An Exploration in Novelty
,
1994
.
[2]
W. Liu,et al.
Optimal design of flat patterns for 3D folded structures by unfolding with topological validation
,
2007,
Comput. Aided Des..
[3]
G. C. Shephard.
Convex polytopes with convex nets
,
1975,
Mathematical Proceedings of the Cambridge Philosophical Society.
[4]
Erik D. Demaine,et al.
Geometric folding algorithms - linkages, origami, polyhedra
,
2007
.
[5]
J. O'Rourke,et al.
Geometric Folding Algorithms: Linkages
,
2007
.