JAIST Repository >
School of Information Science >
Articles >
Journal Articles >

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

Title: Efficient Algorithm for Box Folding
Authors: Mizunashi, Koichi
Horiyama, Takashi
Uehara, Ryuhei
Keywords: Computational Origami
Computational Geometry
Issue Date: 2018-12-21
Publisher: Springer
Magazine name: Lecture Notes in Computer Science
Volume: 11355
Start page: 277
End page: 288
DOI: 10.1007/978-3-030-10564-8_22
Abstract: For a given polygon P and a polyhedron Q, the folding problem asks if Q can be obtained from P by folding it. This simple problem is quite complicated, and there is no known efficient algorithm that solves this problem in general. In this paper, we focus on the case that Q is a box, and the size of Q is not given. That is, input of the box folding problem is a polygon P, and it asks if P can fold to boxes of certain sizes. We note that there exist an infinite number of polygons P that can fold into three boxes of different sizes. In this paper, we give a pseudo polynomial time algorithm that computes all possible ways of folding of P to boxes.
Rights: This is the author-created version of Springer, Koichi Mizunashi, Takashi Horiyama, Ryuhei Uehara, Lecture Notes in Computer Science, 11355, 2018, 277-288. The original publication is available at www.springerlink.com, http://dx.doi.org/10.1007/978-3-030-10564-8_22
URI: http://hdl.handle.net/10119/16199
Material Type: author
Appears in Collections:b10-1. 雑誌掲載論文 (Journal Articles)

Files in This Item:

File Description SizeFormat
25054.pdf286KbAdobe 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