JAIST Repository >
School of Information Science >
Conference Papers >
Conference Papers >

Please use this identifier to cite or link to this item: http://hdl.handle.net/10119/14769

Title: Bumpy Pyramid Folding
Authors: Abel, Zachary R.
Demaine, Erik D.
Demaine, Martin L.
Ito, Hiro
Snoeyink, Jack
Uehara, Ryuhei
Keywords: folding problem
petal polygon
Alexandrov's theorem
Issue Date: 2014-08
Publisher: CCCG 2014
Magazine name: The 26th Canadian Conference on Computational Geometry (CCCG 2014)
Start page: 258
End page: 266
Abstract: 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 pattern) that allows folding into a convex (triangulated) polyhedron. By Alexandrov's theorem, the crease pattern is unique if it exists, but the general algorithm known for this theorem is pseudo-polynomial, with very large running time; ours is the first efficient algorithm for Alexandrov's theorem for a special class of polyhedra. We also give a polynomial time algorithm that finds the crease pattern to produce the maximum volume triangulated polyhedron.
Rights: Copyright (C) 2014 Authors. Zachary R. Abel, Erik D. Demaine, Martin L. Demaine, Hiro Ito, Jack Snoeyink and Ryuhei Uehara, The 26th Canadian Conference on Computational Geometry (CCCG 2014), 2014, 258-266.
URI: http://hdl.handle.net/10119/14769
Material Type: publisher
Appears in Collections:b11-1. 会議発表論文・発表資料 (Conference Papers)

Files in This Item:

File Description SizeFormat
20453.pdf177KbAdobe PDFView/Open

All items in DSpace are protected by copyright, with all rights reserved.


Contact : Library Information Section, Japan Advanced Institute of Science and Technology