Unfolding Orthogrids with Constant Refinement
Mirela Damian, Erik Demaine, Robin Flatland
TL;DR
This paper introduces orthogrids, a new class of orthogonal polyhedra, and proves they can be unfolded without overlap using a constant refinement of their gridded surface.
Contribution
It defines orthogrids and demonstrates their unfoldability with constant surface refinement, advancing geometric unfolding theory.
Findings
Orthogrids can be unfolded without overlap.
Unfolding uses constant refinement of the surface grid.
Provides a new class of polyhedra with guaranteed unfoldability.
Abstract
We define a new class of orthogonal polyhedra, called orthogrids, that can be unfolded without overlap with constant refinement of the gridded surface.
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 Optimization Algorithms Research · Advanced Topics in Algebra · Matrix Theory and Algorithms