Geodesic
Efficient Algorithm for Box Folding
Journal of Graph Algorithms and Applications, Special Issue on Selected Papers from the 13th International Conference and Workshops on Algorithms and Computation, WALCOM 2019 , Tome 24 (2020) no. 2, pp. 89-103.

Voir la notice de l'article provenant de la source Journal of Graph Algorythms and Applications website

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. 
@article{JGAA_2020_24_2_a2,
     author = {Koichi Mizunashi and Takashi Horiyama and Ryuhei Uehara},
     title = {Efficient {Algorithm} for {Box} {Folding}},
     journal = {Journal of Graph Algorithms and Applications},
     pages = {89--103},
     publisher = {mathdoc},
     volume = {24},
     number = {2},
     year = {2020},
     doi = {10.7155/jgaa.00520},
     language = {en},
     url = {http://geodesic.mathdoc.fr/articles/10.7155/jgaa.00520/}
}
TY  - JOUR
AU  - Koichi Mizunashi
AU  - Takashi Horiyama
AU  - Ryuhei Uehara
TI  - Efficient Algorithm for Box Folding
JO  - Journal of Graph Algorithms and Applications
PY  - 2020
SP  - 89
EP  - 103
VL  - 24
IS  - 2
PB  - mathdoc
UR  - http://geodesic.mathdoc.fr/articles/10.7155/jgaa.00520/
DO  - 10.7155/jgaa.00520
LA  - en
ID  - JGAA_2020_24_2_a2
ER  - 
%0 Journal Article
%A Koichi Mizunashi
%A Takashi Horiyama
%A Ryuhei Uehara
%T Efficient Algorithm for Box Folding
%J Journal of Graph Algorithms and Applications
%D 2020
%P 89-103
%V 24
%N 2
%I mathdoc
%U http://geodesic.mathdoc.fr/articles/10.7155/jgaa.00520/
%R 10.7155/jgaa.00520
%G en
%F JGAA_2020_24_2_a2
Koichi Mizunashi; Takashi Horiyama; Ryuhei Uehara. Efficient Algorithm for Box Folding. Journal of Graph Algorithms and Applications, 
							Special Issue on Selected Papers from the 13th International Conference and  Workshops on Algorithms and Computation, WALCOM 2019
					, Tome 24 (2020) no. 2, pp. 89-103. doi : 10.7155/jgaa.00520. http://geodesic.mathdoc.fr/articles/10.7155/jgaa.00520/

Cité par Sources :