We address the unsolved problem of unfolding prismatoids in a new context, viewing a "topless prismatoid" as a convex patch---a polyhedral subset of the surface of a convex polyhedron homeomorphic to a disk. We show that several natural strategies for unfolding a prismatoid can fail, but obtain a positive result for "petal unfolding" topless prismatoids. We also show that the natural extension to a convex patch consisting of a face of a polyhedron and all its incident faces, does not always have a nonoverlapping petal unfolding. However, we obtain a positive result by excluding the problematical patches. This then leads a positive result for restricted prismatoids. Finally, we suggest suggest studying the unfolding of convex patches in general, and offer some possible lines of investigation.
[1]
Marshall W. Bern,et al.
Linear-size nonobtuse triangulation of polygons
,
1994,
SCG '94.
[2]
Joseph O'Rourke.
Band Unfoldings and Prismatoids: A Counterexample
,
2007,
ArXiv.
[3]
Val Pinciu.
On the Fewest Nets Problem for Convex Polyhedra
,
2007,
CCCG.
[4]
G. Aloupis.
Reconfigurations of polygonal structures
,
2005
.
[5]
Erik D. Demaine,et al.
Zipper unfoldings of polyhedral complexes
,
2010,
CCCG.
[6]
Erik D. Demaine,et al.
Geometric folding algorithms - linkages, origami, polyhedra
,
2007
.
[7]
Pat Morin,et al.
Edge-unfolding nested polyhedral bands
,
2008,
Comput. Geom..