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...
| Main Authors: | , , , , , |
|---|---|
| Other Authors: | , , |
| Format: | Article |
| Language: | English |
| Published: |
2015-12-17T01:55:59Z.
|
| Subjects: | |
| Online Access: | Get fulltext |