|
|
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/13757
|
| Title: | Common Developments of Three Incongruent Boxes of Area 30 |
| Authors: | Xu, Dawei
Horiyama, Takashi
Shirakawa, Toshihiro
Uehara, Ryuhei |
| Keywords: | common development
computational origami
ZDD
computational geometry |
| Issue Date: | 2015-05-18 |
| Publisher: | Springer |
| Magazine name: | Lecture Notes in Computer Science |
| Volume: | 9076 |
| Start page: | 236 |
| End page: | 247 |
| DOI: | 10.1007/978-3-319-17142-5_21 |
| Abstract: | We investigate common developments that can fold into plural incongruent orthogonal boxes. Recently, it was shown that there are inｆinitely many orthogonal polygons that folds into three boxes of different size. However, the smallest one that folds into three boxes consists of 532 unit squares. From the necessary condition, the smallest possible surface area that can fold into two boxes is 22, which admits to fold into two boxes of size 1×1×5 and 1×2×3. On the other hand, the smallest possible surface area for three different boxes is 46, which may admit tofold into three boxes of size 1×1×11, 1×2×7, and 1×3×5. For the area 22, it has been shown that there are 2,263 common developments of two boxes by exhaustive search. However, the area 46 is too huge for search. In this paper, we focus on the polygons of area 30, which is the second smallest area of two boxes that admits to fold into two boxes of size 1×1×7 and 1×3×3. Moreover, when we admit to fold along diagonal lines of rectangles of size 1×2, the area may admit to fold into a box of size √<5>×√<5>×√<5>. That is, the area 30 is the smallest candidate area for folding three different boxes in this manner. We perform twoalgorithms. The first algorithm is based on ZDDs, zero suppressed binary decision diagrams, and it computes in 10.2 days on a usual desktop computer. The second algorithm performs exhaustive search, however, straightforward implementation cannot be run even on a supercomputersince it causes memory overflow. Using a hybrid search of DFS and BFS, it completes its computation in 3 months on a supercomputer. As results, we obtain (1) 1,080 common developments of two boxes of size 1×1×7 and 1×3×3, and (2) 9 common developments of three boxes of size 1×1×7, 1×3×3, and √<5>× √<5>×√<5>. |
| Rights: | This is the author-created version of Springer, Dawei Xu, Takashi Horiyama, Toshihiro Shirakawa and Ryuhei Uehara, Lecture Notes in Computer Science, 9076, 2015, 236-247. The original publication is available at www.springerlink.com, http://dx.doi.org/10.1007/978-3-319-17142-5_21 |
| URI: | http://hdl.handle.net/10119/13757 |
| Material Type: | author |
| Appears in Collections: | b10-1. 雑誌掲載論文 (Journal Articles)
|
Files in This Item:
| File |
Description |
Size | Format |
|---|
| 21457.pdf | | 1375Kb | Adobe PDF | View/Open |
|
All items in DSpace are protected by copyright, with all rights reserved.
|
