Grid Vertex-Unfolding Orthostacks

An algorithm was presented in [1] for unfolding orthostacks into one piece without overlap by using arbitrary cuts along the surface. It was conjectured that orthostacks could be unfolded using cuts that lie in a plane orthogonal to a coordinate axis and containing a vertex of the orthostack. We prove the existence of a vertex-unfolding using only such cuts.

• Type: Conference
• Year: 2004
• Where: JCDCG
• Authors: Erik D. Demaine, John Iacono, Stefan Langerman
• Keywords: Algorithm, Arbitrary Cuts, Discrete Geometry, JCDCG 2004, Unfolding