Folding flat silhouettes and wrapping polyhedral packages: new results in computational origami

We show a remarkable fact about folding paper: From a single rectangular sheet of paper, one can fold it into a ∞at origami that takes the (scaled) shape of any connected polygonal region, even if it has holes. This resolves a long-standing open problem in origami design. Our proof is constructive, utilizing tools of computational geometry, resulting in e‐cient algorithms for achieving the target silhouette. We show further that if the paper has a difierent color on each side, we can form any connected polygonal pattern of two colors. Our results apply also to polyhedral surfaces, showing that any polyhedron can be \wrapped" by folding a strip of paper around it. We give three methods for solving these problems: the flrst uses a thin strip whose area is arbitrarily close to optimal; the second allows wider strips to be used; and the third varies the strip width to optimize the number or length of visible \seams" subject to some restrictions.

[1]  F. Frances Yao,et al.  Computational Geometry , 1991, Handbook of Theoretical Computer Science, Volume A: Algorithms and Complexity.

[2]  Kunihiko Kasahara,et al.  Origami for the Connoisseur , 1987 .

[3]  Esther M. Arkin,et al.  Angewandte Mathematik Und Informatik Universit at Zu K Oln Approximation Algorithms for Lawn Mowing and Milling Ss Andor P.fekete Center for Parallel Computing Universitt at Zu Kk Oln D{50923 Kk Oln Germany Approximation Algorithms for Lawn Mowing and Milling , 2022 .

[4]  J. Mark Keil,et al.  Decomposing a Polygon into Simpler Components , 1985, SIAM J. Comput..

[5]  J. Mark Keil,et al.  Polygon Decomposition , 2000, Handbook of Computational Geometry.

[6]  Franz Aurenhammer,et al.  Straight Skeletons for General Polygonal Figures in the Plane , 1996, COCOON.

[7]  John Montroll.  Origami Inside-Out , 1993 .

[8]  Robert J. Lang,et al.  A computational algorithm for origami design , 1996, SCG '96.

[9]  C. B. Wilson,et al.  The mathematical description of shape and form , 1984 .

[10]  Franz Aurenhammer,et al.  A Novel Type of Skeleton for Polygons , 1995, J. Univers. Comput. Sci..

[11]  Jin Akiyama,et al.  Wrapping a Cube , 1997 .

[12]  B. Chazelle,et al.  Optimal Convex Decompositions , 1985 .

[13]  David Eppstein,et al.  Raising roofs, crashing cycles, and playing pool: applications of a data structure for finding pairwise interactions , 1998, SCG '98.

[14]  John Montroll.  African Animals in Origami , 1991 .

[15]  Andrzej Lingas,et al.  The Power of Non-Rectilinear Holes , 1982, ICALP.

[16]  Marshall W. Bern,et al.  The complexity of flat origami , 1996, SODA '96.