Unfolding Manhattan Towers

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.

💡 Research Summary

The paper addresses the long‑standing problem of unfolding orthogonal polyhedra without overlap, focusing on a specific subclass that the authors call “Manhattan Towers.” A Manhattan Tower is defined as an orthogonal polyhedron whose base is a rectangle and whose cross‑section at any integer height forms a Manhattan‑skyline silhouette: a collection of axis‑aligned rectangular blocks (stacks) possibly connected by horizontal protrusions (legs). This structural restriction eliminates many of the pathological configurations that make general orthogonal unfolding difficult.

The authors first introduce a 4 × 5 × 1 refinement of the underlying vertex grid. In practice this means that each unit cell of the original polyhedron is subdivided into a 4‑by‑5 grid in the horizontal plane while the vertical direction is left unrefined (a single layer). The refinement guarantees that every edge of the polyhedron lies on a grid line, allowing cuts to be performed exclusively along these lines. The refinement factor is deliberately kept small (constant) to keep the algorithm practical while still providing enough degrees of freedom to avoid overlap.

The core of the algorithm is a hierarchical decomposition into “slabs.” A slab consists of all cells that share the same height interval; each slab can be further partitioned into stacks (vertical columns of identical footprint) and legs (horizontal connectors between stacks). The unfolding proceeds slab by slab, starting from the lowest slab and moving upward. Within a slab the authors employ a spiral (or “naïve‑spiral”) cutting pattern that runs around the perimeter of each stack, always following grid lines. Legs are inserted into the gaps created by the spiral, ensuring that the entire slab can be laid flat as a single orthogonal polygon.

To guarantee non‑overlap across slabs, the algorithm defines “ports” – small rectangular attachment regions on the already‑unfolded part of the layout. When a new slab is unfolded, it is positioned relative to its port using only 90‑degree rotations and integer translations that respect the refined grid. The authors prove by induction that ports can be chosen so that the bounding boxes of successive slabs are disjoint, which directly implies that the final planar layout contains no self‑intersection.

Complexity analysis shows that the algorithm performs O(n) cuts, where n is the number of vertices of the original polyhedron. The refinement step adds only a constant factor (4 × 5 × 1), so the overall time complexity is linear in the input size, and the memory consumption is also linear. The resulting planar shape is an orthogonal polygon, which makes it immediately compatible with downstream applications such as sheet‑metal layout, CNC cutting, or 3D‑printing support generation.

The paper’s contributions can be summarized as follows:

1. New Polyhedron Class – Introduction of Manhattan Towers, a natural and expressive subclass of orthogonal polyhedra that captures many practical models (e.g., city‑block style buildings, stacked storage units).
2. Constant‑Factor Grid Refinement – Demonstration that a modest 4 × 5 × 1 refinement suffices to guarantee a non‑overlapping unfolding, a result that improves upon prior work requiring much larger refinement factors.
3. Spiral‑Based Slab Unfolding – Development of a simple, fully orthogonal cutting scheme that works recursively on slabs and avoids any diagonal or non‑grid cuts.
4. Linear‑Time Algorithm – Proof that the entire unfolding process runs in O(n) time and uses O(n) space, making it feasible for large models.
5. Practical Output – Production of a single connected orthogonal polygon, ready for practical manufacturing pipelines without additional post‑processing.

In the discussion, the authors note that while Manhattan Towers are a restricted class, they already encompass a wide range of real‑world objects. They suggest future work to extend the slab‑spiral technique to more general orthogonal polyhedra, possibly by adaptive refinement or by combining multiple slab orientations. Another promising direction is to integrate the unfolding with optimization objectives such as minimizing the perimeter of the unfolded shape or balancing aspect ratios for material efficiency.

Overall, the paper provides a clear, constructive proof that every Manhattan Tower can be unfolded into a planar orthogonal polygon without overlap, using only a small, constant‑size grid refinement and a conceptually simple spiral cutting pattern. This advances both the theoretical understanding of orthogonal unfolding and its practical applicability in manufacturing and computational geometry.