GRID VERTEX-UNFOLDING ORTHOSTACKS
Erik D. Demaine, John Iacono, Stefan Langerman · International Journal of Computational Geometry & Applications · 2010
Biedl et al.1 presented an algorithm for unfolding orthostacks into one piece without overlap by using arbitrary cuts along the surface. They 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.