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. © 2007 Elsevier B.V.
Author supplied keywords
Cite
CITATION STYLE
APA
Damian, M., Flatland, R., & O’Rourke, J. (2008). Unfolding Manhattan towers. Computational Geometry: Theory and Applications, 40(2), 102–114. https://doi.org/10.1016/j.comgeo.2007.07.003
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
Already have an account? Sign in
Sign up for free