We investigate common developments that can fold into plural incongruent orthogonal boxes. Recently, it was shown that there are infinitely 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\times 1\times 5\) and \(1\times 2\times 3\). On the other hand, the smallest possible surface area for three different boxes is 46, which may admit to fold into three boxes of size \(1\times 1\times 11\), \(1\times 2\times 7\), and \(1\times 3\times 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\times 1\times 7\) and \(1\times 3\times 3\). Moreover, when we admit to fold along diagonal lines of rectangles of size \(1\times 2\), the area may admit to fold into a box of size \(\sqrt{5}\times \sqrt{5}\times \sqrt{5}\). That is, the area 30 is the smallest candidate area for folding three different boxes in this manner. We perform two algorithms. 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 supercomputer since 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\times 1\times 7\) and \(1\times 3\times 3\), and (2) 9 common developments of three boxes of size \(1\times 1\times 7\), \(1\times 3\times 3\), and \(\sqrt{5}\times \sqrt{5}\times \sqrt{5}\).
[1]
Takashi Horiyama,et al.
Common Unfolding of Regular Tetrahedron and Johnson-Zalgaller Solid
,
2016,
J. Graph Algorithms Appl..
[2]
Ryuhei Uehara.
Polygons Folding to Plural Incongruent Orthogonal Boxes
,
2008,
CCCG.
[3]
V. Rich.
Personal communication
,
1989,
Nature.
[4]
Jin Akiyama,et al.
Developments of Polyhedra Using Oblique Coordinates
,
2007
.
[5]
Ryuhei Uehara,et al.
Common Developments of Three Incongruent Orthogonal Boxes
,
2013,
Int. J. Comput. Geom. Appl..
[6]
Erik D. Demaine,et al.
Bumpy Pyramid Folding
,
2014,
CCCG.
[7]
J. O'Rourke,et al.
When Can a Polygon Fold to a Polytope
,
1999
.
[8]
Günter Rote,et al.
Common Developments of Several Different Orthogonal Boxes
,
2011,
CCCG.
[9]
Shin-ichi Minato,et al.
Zero-Suppressed BDDs for Set Manipulation in Combinatorial Problems
,
1993,
30th ACM/IEEE Design Automation Conference.
[10]
Takeru Inoue,et al.
Frontier-Based Search for Enumerating All Constrained Subgraphs with Compressed Representation
,
2017,
IEICE Trans. Fundam. Electron. Commun. Comput. Sci..
[11]
Erik D. Demaine,et al.
Geometric folding algorithms - linkages, origami, polyhedra
,
2007
.
[12]
Jin Akiyama.
Tile-Makers and Semi-Tile-Makers
,
2007,
Am. Math. Mon..
[13]
Daniel M. Kane,et al.
A Pseudopolynomial Algorithm for Alexandrov's Theorem
,
2009,
WADS.