Article ID | Journal | Published Year | Pages | File Type |
---|---|---|---|---|
4949114 | Computational Geometry | 2017 | 12 Pages |
Abstract
We investigate common developments that can fold into plural incongruent orthogonal boxes. Recently, it was shown that there are infinitely many orthogonal polygons that fold 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, and the smallest possible surface area for three different boxes is 46. 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 to 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 fold along diagonal lines of rectangles of size 1Ã2, this area 30 may admit to fold into a box of size 5Ã5Ã5. The results are summarized as follows. There exist 1,080 common developments of two boxes of size 1Ã1Ã7 and 1Ã3Ã3. Among them, there are nine common developments of three boxes of size 1Ã1Ã7, 1Ã3Ã3, and 5Ã5Ã5. Interestingly, one of nine such polygons folds into three different boxes 1Ã1Ã7, 1Ã3Ã3, and 5Ã5Ã5 in four different ways.
Keywords
Related Topics
Physical Sciences and Engineering
Computer Science
Computational Theory and Mathematics
Authors
Dawei Xu, Takashi Horiyama, Toshihiro Shirakawa, Ryuhei Uehara,