Unfolding Manhattan Towers
Mirela Damian, Robin Flatland, Joseph O'Rourke

TL;DR
This paper presents an algorithm to unfold Manhattan Towers, a specific class of orthogonal polyhedra, into a nonoverlapping planar shape by cutting along a refined grid of edges.
Contribution
It introduces a novel unfolding algorithm tailored for Manhattan Towers, expanding the class of polyhedra that can be unfolded without overlap.
Findings
Successfully unfolds all Manhattan Towers into planar polygons.
Uses a 4x5x1 grid refinement for edge cuts.
Ensures nonoverlapping planar unfoldings.
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.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
