2000 character limit reached
Unfolding Manhattan Towers (0705.1541v1)
Published 10 May 2007 in cs.CG and cs.DM
Abstract: We provide an algorithm for unfolding the surface of any orthogonal polyhedron that falls into a particular shape class we call Manhattan Towers, to a nonoverlapping planar orthogonal polygon. The algorithm cuts along edges of a 4x5x1 refinement of the vertex grid.