An \textit{unfolding} \(U\) of the boundary bd\((P)\) of a convex 3D polyhedron \(P\) is obtained by removing finitely many arcs from bd\((P)\) such that the intrinsic metric of the remainder \(U\) is isometric to the interior of a non-self-overlapping polygon \(Q\). Cuts are not restricted to the edges of \(P\). The unfolding consists of plates and hinges (remaining parts of edges of \(P\)). A \textit{continuous blooming} of \(U\) is a continuous motion of \(U\) to the interior of \(Q\) that avoids intersections of distinct plates throughout the motion. Connelly conjectured that every convex polyhedron admits an unfolding with continuous blooming (see Conjecture 9.12 from [\textit{E. Miller} and \textit{I. Pak}, Discrete Comput. Geom. 39, No. 1-3, 339--388 (2008; Zbl 1140.52008)]). This conjecture is confirmed in the algorithmic sense. The source unfolding (see [\textit{M. Sharir} and \textit{A. Schorr}, SIAM J. Comput. 15, 193--215 (1986; Zbl 0612.68090)] and [\textit{E. Miller} and \textit{I. Pak}, Discrete Comput. Geom. 39, No. 1-3, 339--388 (2008; Zbl 1140.52008)]) has continuous blooming and any unfolding can be refined (by a linear number of cuts) into an unfolding with continuous blooming. Here blooming monotonically opens all hinge dihedral angles.
- Edge-unfolding nested polyhedral bands
- Epsilon-unfolding orthogonal polyhedra
- Geometric folding algorithms. Linkages, origami, polyhedra
- Metric combinatorics of convex polyhedra: cut loci and nonoverlapping unfoldings
- Nonoverlap of the star unfolding
- On Shortest Paths in Polyhedral Spaces
- Star unfolding convex polyhedra via quasigeodesic loops
- Ununfoldable polyhedra with convex faces
- When can a net fold to a polyhedron?
This page was built for publication: Continuous blooming of convex polyhedra
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q659710)
