Continuous Flattening of All Polyhedral Manifolds using Countably Infinite Creases

05/22/2021
by   Zachary Abel, et al.
0

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.

READ FULL TEXT
research
03/13/2023

On the width of complicated JSJ decompositions

Motivated by the algorithmic study of 3-dimensional manifolds, we explor...
research
06/01/2023

Complexity of Simple Folding of Mixed Orthogonal Crease Patterns

Continuing results from JCDCGGG 2016 and 2017, we solve several new case...
research
06/08/2020

Learning disconnected manifolds: a no GANs land

Typical architectures of Generative AdversarialNetworks make use of a un...
research
01/25/2012

A toolkit to describe and interactively display three-manifolds embedded in four-space

A data structure and toolkit are presented here that allow for the descr...
research
10/09/2020

Adaptive and Momentum Methods on Manifolds Through Trivializations

Adaptive methods do not have a direct generalization to manifolds as the...
research
12/01/2017

On the treewidth of triangulated 3-manifolds

In graph theory, as well as in 3-manifold topology, there exist several ...
research
03/11/2023

Finding large counterexamples by selectively exploring the Pachner graph

We often rely on censuses of triangulations to guide our intuition in 3-...

Please sign up or login with your details

Forgot password? Click here to reset