Continuously Flattening Polyhedra Using Straight Skeletons

We prove that a surprisingly simple algorithm folds the surface of every convex polyhedron, in any dimension, into a flat folding by a continuous motion, while preserving intrinsic distances and avoiding crossings. The flattening respects the straight-skeleton gluing, meaning that points of the poly...

Full description

Bibliographic Details
Main Authors: Demaine, Erik D. (Contributor), Demaine, Martin L. (Contributor), Itoh, Jin-ichi (Author), Lubiw, Anna (Author), Nara, Chie (Author), O'Rourke, Joseph (Author), Abel, Zachary Ryan (Contributor)
Other Authors: Massachusetts Institute of Technology. Computer Science and Artificial Intelligence Laboratory (Contributor), Massachusetts Institute of Technology. Department of Electrical Engineering and Computer Science (Contributor), Massachusetts Institute of Technology. Department of Mathematics (Contributor)
Format: Article
Language:English
Published: Association for Computing Machinery (ACM), 2015-11-23T15:29:18Z.
Subjects:
Online Access:Get fulltext