Abstract We show that every convex polyhedron may be unfolded to one planar piece, and then refolded to a different convex polyhedron. If the unfolding is restricted to cut only edges of the polyhedron, we identify several polyhedra that are “edge-refold rigid” in the sense that each of their unfoldings may only fold back to the original. For example, each of the 43,380 edge unfoldings of a dodecahedron may only fold back to the dodecahedron, and we establish that 11 of the 13 Archimedean solids are also edge-refold rigid. We begin the exploration of which classes of polyhedra are and are not edge-refold rigid, demonstrating infinite rigid classes through perturbations, and identifying one infinite nonrigid class: tetrahedra.
[1]
Erik D. Demaine,et al.
Zipper unfoldings of polyhedral complexes
,
2010,
CCCG.
[2]
Takashi Horiyama,et al.
Edge Unfoldings of Platonic Solids Never Overlap
,
2011,
CCCG.
[3]
J. O'Rourke,et al.
When Can a Polygon Fold to a Polytope
,
1999
.
[4]
J. O'Rourke,et al.
Geometric Folding Algorithms: Linkages
,
2007
.
[5]
D. Chand,et al.
On Convex Polyhedra
,
1970
.
[6]
Joseph O'Rourke.
Flat Zipper-Unfolding Pairs for Platonic Solids
,
2010,
ArXiv.
[7]
Erik D. Demaine,et al.
Geometric folding algorithms - linkages, origami, polyhedra
,
2007
.
[8]
Erik D. Demaine,et al.
Metamorphosis of the cube
,
1999,
SCG '99.