Common developments of three incongruent boxes of area 30 (Q2398819)

The paper is dedicated to the study of a developement/ folding type problem. This is a very important topic in computational geometry. One problem of this kind is the following one: Given a polygon \(P\) and a polyhedra \(Q\), determine whether \(P\) can fold into \(Q\) or not. The authors answer this question. Also, they give an important theorem, where they prove that there are 1080 polyominoes of area 30, that admit to fold. Among the above 1080, the authors prove that nine polyominoes can fold into the box of size \(\sqrt{5}\times \sqrt{5}\times \sqrt{5}\) if admit to fold along diagonal lines. Finally, the authors prove that among these nine polyominoes, one can fold into the third box in two different ways. The authors give also a graphical representation to this theorem and some important algorithms for the paper's topic are presented.