| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 414417 | Computational Geometry | 2008 | 13 Pages |
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.
Related Topics
Physical Sciences and Engineering
Computer Science
Computational Theory and Mathematics
