Unfolding Manhattan Towers

Authors:
Mirela Damian;Robin Flatland;Joseph O'Rourke
Affiliations:
Department of Computer Science, Villanova University, Villanova, PA 19085, USA;Department of Computer Science, Siena College, Loudonville, NY 12211, USA;Department of Computer Science, Smith College, Northampton, MA 01063, USA
Venue:
Computational Geometry: Theory and Applications
Year:
2008

Citing 2
Cited 0

Art gallery theorems and algorithms

Art gallery theorems and algorithms
Geometric Folding Algorithms: Linkages, Origami, Polyhedra

Geometric Folding Algorithms: Linkages, Origami, Polyhedra

Quantified Score

Hi-index	0.00

Visualization

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.