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., Demaine, Martin L., Itoh, Jin-ichi, Lubiw, Anna, Nara, Chie, O'Rourke, Joseph, Abel, Zachary Ryan
Other Authors: Massachusetts Institute of Technology. Computer Science and Artificial Intelligence Laboratory
Format: Article
Language:en_US
Published: Association for Computing Machinery (ACM) 2015
Online Access:http://hdl.handle.net/1721.1/99990
https://orcid.org/0000-0003-3803-5703
https://orcid.org/0000-0002-4295-1117