Document Type
Article
Publication Date
7-2008
Publication Title
Computational Geometry
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 4×5×1 refinement of the vertex grid.
Keywords
Unfolding, Orthogonal, Genus-zero, Polyhedron
Volume
40
Issue
2
First Page
102
Last Page
114
DOI
dx.doi.org/10.1016/j.comgeo.2007.07.003
ISSN
0925-7721
Recommended Citation
Damian, Mirela; Flatland, Robin; and O'Rourke, Joseph, "Unfolding Manhattan Towers" (2008). Computer Science: Faculty Publications, Smith College, Northampton, MA.
https://scholarworks.smith.edu/csc_facpubs/51
Comments
Author’s submitted manuscript. Another version of this paper was published in the Proceedings of the 17th Canadian Conference on Computational Geometry (CCCG'05), available at http://www.cccg.ca/proceedings/2005/.