Continuous flattening of all polyhedral manifolds using countably infinite creases

DOI10.1016/J.COMGEO.2021.101773MaRDI QIDQ2230401zbMATH OpenOpenAlexFDO

Authors Erik D. Demaine, Martin L. Demaine, Jason S. Ku, Jayson Lynch, Jin-Ichi Itoh, Chie Nara, Zachary R. Abel

Publication date 17 September 2021

Published in Computational Geometry (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/2105.10774

zbMATH Keywords

finite polyhedral manifoldflatteningfoldingorigami

Mathematics Subject Classification ID

Geometric constructions in real or complex geometry (51M15) Polyhedral manifolds (52B70)

Abstract: We prove that any finite polyhedral manifold in 3D can be continuously flattened into 2D while preserving intrinsic distances and avoiding crossings, answering a 19-year-old open problem, if we extend standard folding models to allow for countably infinite creases. The most general cases previously known to be continuously flattenable were convex polyhedra and semi-orthogonal polyhedra. For non-orientable manifolds, even the existence of an instantaneous flattening (flat folded state) is a new result. Our solution extends a method for flattening semi-orthogonal polyhedra: slice the polyhedron along parallel planes and flatten the polyhedral strips between consecutive planes. We adapt this approach to arbitrary nonconvex polyhedra by generalizing strip flattening to nonorthogonal corners and slicing along a countably infinite number of parallel planes, with slices densely approaching every vertex of the manifold. We also show that the area of the polyhedron that needs to support moving creases (which are necessary for closed polyhedra by the Bellows Theorem) can be made arbitrarily small.

Recommendations

• Continuous flattening of convex polyhedra
• Continuous flattening of orthogonal polyhedra
• Continuously flattening polyhedra using straight skeletons
• Internal continuous flattening of polyhedra
• Continuous flattening of the 2-skeletons in regular simplexes and cross-polytopes

Cites work

• Continuous flattening of convex polyhedra
• Continuous flattening of orthogonal polyhedra
• Continuous Flattening of Platonic Polyhedra
• Continuously flattening polyhedra using straight skeletons
• Filling a hole in a crease pattern: Isometric mapping from prescribed boundary folding
• Geometric folding algorithms. Linkages, origami, polyhedra
• Internal continuous flattening of polyhedra
• Origami embedding of piecewise-linear two-manifolds
• Rigid flattening of polyhedra with slits
• The Bellows conjecture
• Wrapping spheres with flat paper

Cited in

(7)

• Internal continuous flattening of polyhedra
• Continuous flattening of the 2-skeletons in regular simplexes and cross-polytopes
• Continuous flattening of orthogonal polyhedra
• Continuous flattening of extended bipyramids with rigid radial edges
• Continuously flattening polyhedra using straight skeletons
• Continuous flattening of convex polyhedra
• Maximum numbers of rigid faces and edges in continuous flattening of regular polyhedra

This page was built for publication: Continuous flattening of all polyhedral manifolds using countably infinite creases

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2230401)