[Paper Review] Unfolding Orthogonal Terrains

Joseph O’Rourke|ArXiv.org|Jul 4, 2007

Advanced Theoretical and Applied Studies in Material Sciences and Geometry4 references3 citations

TL;DR

This paper presents a grid unfolding algorithm for orthogonal terrains—3D orthogonal polyhedra with a rectangular base and monotone vertical cross-sections—by unfolding side and top faces into planar strips connected via vertical bridges, ensuring no interior overlap. The key result is a constructive proof that every orthogonal terrain admits a 1×1 grid unfolding using only vertex-defined grid edges.

ABSTRACT

It is shown that every orthogonal terrain, i.e., an orthogonal (right-angled) polyhedron based on a rectangle that meets every vertical line in a segment, has a grid unfolding: its surface may be unfolded to a single non-overlapping piece by cutting along grid edges defined by coordinate planes through every vertex.

Motivation & Objective

• To address the open problem of whether all orthogonal polyhedra admit a 1×1 grid unfolding.
• To extend known grid-unfolding results to a new class of orthogonal polyhedra: orthogonal terrains with a rectangular base and monotone vertical cross-sections.
• To develop a continuous, non-overlapping unfolding algorithm that avoids interior point overlap while using only grid edges through vertices.
• To demonstrate that the restriction to a rectangular base enables a simpler, more general unfolding algorithm than broader classes like 'Manhattan towers'.

Proposed method

• The algorithm begins by unfolding the right, left, and back vertical faces onto the base plane, maintaining attachment to the base.
• The base and its attached faces are then rotated around the x-axis and the front vertical faces are unfolded horizontally.
• The top surface is partitioned into x_i-strips, each spanning a y-interval [i, i+1], consisting of horizontal xy-faces and connecting y-aligned vertical yz-faces.
• Each x_i-strip is unfolded as a horizontal rectangle in the plane, with adjacent strips separated vertically by the height of the tallest connecting xz-face (bridge) between them.
• Vertical xz-faces (bridges) are attached above each strip and aligned so they connect corresponding faces across strips, preserving connectivity and avoiding overlap.
• The entire unfolding is executed as a continuous motion, ensuring no self-intersection or interior overlap occurs at any stage.

Experimental results

Research questions

• RQ1 Can every orthogonal terrain be unfolded into a single non-overlapping planar piece using only cuts along grid edges defined by coordinate planes through vertices?
• RQ2 Does the rectangular base condition enable a simpler and more general grid-unfolding algorithm compared to broader classes like 'Manhattan towers'?
• RQ3 Is it possible to achieve a 1×1 grid unfolding (no face subdivision) for orthogonal terrains using a continuous, non-overlapping unfolding process?
• RQ4 What happens to the unfolding algorithm when the z-axis is slanted, and does it still avoid overlap?

Key findings

• Every orthogonal terrain admits a 1×1 grid unfolding using only grid edges defined by coordinate planes through each vertex, proving a positive result for this class.
• The algorithm produces a weakly simple polygonal unfolding where boundary overlaps are allowed, but no interior points overlap, satisfying the non-overlap condition.
• The unfolding is achieved via a continuous motion that avoids self-intersection throughout, not just at the final configuration.
• The method relies on unfolding the terrain in x_i-strips, with vertical separation between strips determined by the height of the tallest connecting xz-face (bridge) between them.
• The algorithm fails when the z-axis is slanted (e.g., 30° toward the y-axis), as demonstrated by overlap in partial unfoldings, indicating limitations under non-orthogonal axis alignment.