Bumpy Pyramids Folded from Petal Polygons
- 139 Downloads
In this chapter, we consider a special set of polygons and convex polyhedra folded from it. After giving the (counterintuitive) answers to the puzzle given in this book, we consider the folding problem of (bumpy) pyramids folded from a special set of polygons called “petal polygons”.
- [BI08]A.I. Bobenko, I. Izmestiev, Alexandrov’s theorem, weighted Delaunay triangulations, and mixed volumes (2008), arXiv:math.DG/0609447
- [KPD09]D. Kane, G.N. Price, E.D. Demaine, A pseudopolynomial algorithm for Alexandrov’s theorem, in 11th Algorithms and Data Structures Symposium (WADS 2009), pp. 435–446. Lecture Notes in Computer Science vol. 5664 (Springer, 2009)Google Scholar