Flat Foldings of Plane Graphs with Prescribed Angles and Edge Lengths

Flat Foldings of Plane Graphs with Prescribed Angles and Edge Lengths

When can a plane graph with prescribed edge lengths and prescribed angles (from among {0,180°, 360°}) be folded flat to lie in an infinitesimally thick line, without crossings? This problem generalizes the classic theory of single-vertex flat origami with prescribed mountain-valley assignment, which...

Full description

Bibliographic Details
Main Authors: Demaine, Erik D. (Contributor), Demaine, Martin L. (Contributor), Eppstein, David (Author), Lubiw, Anna (Author), Uehara, Ryuhei (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: Springer-Verlag, 2015-11-23T16:35:55Z.
Subjects:
Article
Online Access:Get fulltext

Internet

Get fulltext

Similar Items