Grid Vertex-Unfolding Orthostacks

摘要

An algorithm was presented in [BDD~+98] for unfolding or-thostacks 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.