Bumpy pyramid folding

Bumpy pyramid folding

We investigate folding problems for a class of petal polygons P, which have an n-polygonal base B surrounded by a sequence of triangles. We give linear time algorithms using constant precision to determine if P can fold to a pyramid with flat base B, and to determine a triangulation of B (crease pat...

Full description

Bibliographic Details
Main Authors: Abel, Zachary Ryan (Contributor), Demaine, Erik D. (Contributor), Demaine, Martin L. (Contributor), Ito, Hiro (Author), Snoeyink, Jack (Author), Uehara, Ryuhei (Author)
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: 2015-12-17T01:55:59Z.
Subjects:
Article
Online Access:Get fulltext

Internet

Get fulltext

Similar Items