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 p...
| Main Authors: | , , , , , |
|---|---|
| Other Authors: | |
| Format: | Article |
| Language: | en_US |
| Published: |
2015
|
| Online Access: | http://hdl.handle.net/1721.1/100406 https://orcid.org/0000-0003-3803-5703 https://orcid.org/0000-0002-4295-1117 |