Unfolding Orthogonal Terrains
Joseph O'Rourke

TL;DR
This paper proves that all orthogonal terrains, which are right-angled polyhedra based on rectangles, can be unfolded into a flat, non-overlapping shape using cuts along grid edges defined by coordinate planes.
Contribution
It introduces a universal grid unfolding method for orthogonal terrains, demonstrating that their surfaces can be flattened without overlaps using specific grid-based cuts.
Findings
All orthogonal terrains have a grid unfolding.
Unfolding is achieved by cutting along coordinate grid edges.
The method guarantees a non-overlapping flat shape.
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.
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.
Taxonomy
TopicsAdvanced Theoretical and Applied Studies in Material Sciences and Geometry · Advanced Materials and Mechanics · Architecture and Computational Design
The reference list from the paper itself. Each links out to its DOI / PubMed record.
- 1[BDD + 98] Therese Biedl, Erik D. Demaine, Martin L. Demaine, Anna Lubiw, Joseph O’Rourke, Mark Overmars, Steve Robbins, and Sue Whitesides. Unfolding some classes of orthogonal polyhedra. In Proc. 10th Canad. Conf. Comput. Geom. , pages 70–71, 1998. Full version in Elec. Proc. : http://cgm.cs.mcgill.ca/cccg 98/proceedings/cccg 98-biedl-unfolding.ps.gz% .
- 2[DFO 05] Mirela Damian, Robin Flatland, and Joseph O’Rourke. Unfolding Manhattan towers. In Proc. 17th Canad. Conf. Comput. Geom. , pages 204–207, 2005. Full version: ar Xiv:0705.1541 v 1 [cs.CG].
- 3[DO 05] Erik D. Demaine and Joseph O’Rourke. Open problems from CCCG 2004. In Proc. 17th Canad. Conf. Comput. Geom. , pages 303–306, 2005.
- 4[DO 07] Erik D. Demaine and Joseph O’Rourke. Geometric Folding Algorithms: Linkages, Origami, Polyhedra . Cambridge University Press, June 2007. http://www.gfalop.org .
- 5[O’R 07] Joseph O’Rourke. Unfolding orthogonal polyhedra. In J.E. Goodman, J. Pach, and R. Pollack, editors, Proc. Snowbird Conference Discrete and Computational Geometry: Twenty Years Later . American Mathematical Society, 2007. To appear.
