Creating Optimized Cut-Out Sheets for Paper Models from Meshes

We propose an algorithm that creates optimized cut-out sheets for paper models from textured polygon meshes. Crafting time and usage of paper and glue are reduced by first computing an initial folding tree to unfold the mesh into a plane. Overlaps in the plane are then eliminated by adding new cuts. Finally, glue tabs are generated along all cuts before fitting all unfolded parts onto paper sheets using a 2D bin packing algorithm.

[1]  Jin Akiyama,et al.  Revised Papers from the Japanese Conference on Discrete and Computational Geometry , 1998 .

[2]  Takeo Igarashi,et al.  Adaptive unwrapping for interactive texture painting , 2001, I3D '01.

[3]  Vijay V. Vazirani,et al.  Approximation Algorithms , 2001, Springer Berlin Heidelberg.

[4]  David Eppstein,et al.  Ununfoldable polyhedra with convex faces , 1999, Comput. Geom..

[5]  Thomas C. Hull.  Origami design secrets: mathematical methods for an ancient art , 2005 .

[6]  Erik D. Demaine,et al.  Unfolding some classes of orthogonal polyhedra , 1998, CCCG.

[7]  Kenneth Falconer,et al.  Unsolved Problems In Geometry , 1991 .

[8]  R. Lang.  Origami Design Secrets: Mathematical Methods for an Ancient Art , 2003 .

[9]  Robert E. Tarjan,et al.  A Linear-Time Algorithm for Testing the Truth of Certain Quantified Boolean Formulas , 1979, Inf. Process. Lett..

[10]  Boris Aronov,et al.  Star Unfolding of a Polytope with Applications , 1997, SIAM J. Comput..

[11]  Konrad Polthier.  Imaging maths - Unfolding polyhedra , 2009 .

[12]  Hantao Zhang,et al.  Improving exact algorithms for MAX-2-SAT , 2005, Annals of Mathematics and Artificial Intelligence.

[13]  Leif Kobbelt,et al.  OpenMesh: A Generic and Efficient Polygon Mesh Data Structure , 2002 .

[14]  Daniele Vigo,et al.  The Three-Dimensional Bin Packing Problem , 2000, Oper. Res..

[15]  J. Mitani,et al.  Making papercraft toys from meshes using strip-based approximate unfolding , 2004, SIGGRAPH 2004.

[16]  Robert E. Tarjan,et al.  Bounds on Backtrack Algorithms for Listing Cycles, Paths, and Spanning Trees , 1975, Networks.

[17]  David Eppstein,et al.  Ununfoldable polyhedra , 1999, CCCG.

[18]  Joseph O'Rourke,et al.  Folding and Unfolding in Computational Geometry , 1998, JCDCG.

[19]  G. Toussaint.  Solving geometric problems with the rotating calipers , 1983 .