Making papercraft toys from meshes using strip-based approximate unfolding

We propose a new method for producing unfolded papercraft patterns of rounded toy animal figures from triangulated meshes by means of strip-based approximation. Although in principle a triangulated model can be unfolded simply by retaining as much as possible of its connectivity while checking for intersecting triangles in the unfolded plane, creating a pattern with tens of thousands of triangles is unrealistic. Our approach is to approximate the mesh model by a set of continuous triangle strips with no internal vertices. Initially, we subdivide our mesh into parts corresponding to the features of the model. We segment each part into zonal regions, grouping triangles which are similar topological distances from the part boundary. We generate triangle strips by simplifying the mesh while retaining the borders of the zonal regions and additional cut-lines. The pattern is then created simply by unfolding the set of strips. The distinguishing feature of our method is that we approximate a mesh model by a set of continuous strips, not by other ruled surfaces such as parts of cones or cylinders. Thus, the approximated unfolded pattern can be generated using only mesh operations and a simple unfolding algorithm. Furthermore, a set of strips can be crafted just by bending the paper (without breaking edges) and can represent smooth features of the original mesh models.

[1]  Greg Turk,et al.  Re-tiling polygonal surfaces , 1992, SIGGRAPH.

[2]  Tony DeRose,et al.  Mesh optimization , 1993, SIGGRAPH.

[3]  Gershon Elber,et al.  Model fabrication using surface layout projection , 1995, Comput. Aided Des..

[4]  Helmut Pottmann,et al.  Developable rational Bézier and B-spline surfaces , 1995, Comput. Aided Geom. Des..

[5]  Steven Skiena,et al.  Optimizing triangle strips for fast rendering , 1996, Proceedings of Seventh Annual IEEE Visualization '96.

[6]  Michael Garland,et al.  Surface simplification using quadric error metrics , 1997, SIGGRAPH.

[7]  Victor J. Milenkovic,et al.  Rotational polygon containment and minimum enclosure , 1998, SCG '98.

[8]  Josef Hoschek,et al.  Approximation of surfaces of revolution by developable surfaces , 1998, Comput. Aided Des..

[9]  Gabriel Taubin,et al.  Geometric compression through topological surgery , 1998, TOGS.

[10]  Paolo Cignoni,et al.  Metro: Measuring Error on Simplified Surfaces , 1998, Comput. Graph. Forum.

[11]  Johannes Wallner,et al.  On Surface Approximation Using Developable Surfaces , 1999, Graph. Model. Image Process..

[12]  Jonathan D. Cohen,et al.  Concepts and Algorithms for Polygonal Simplification , 2000 .

[13]  Michael Garland,et al.  Hierarchical face clustering on polygonal surfaces , 2001, I3D '01.

[14]  Markus H. Gross,et al.  Multiresolution feature extraction for unstructured meshes , 2001, Proceedings Visualization, 2001. VIS '01..

[15]  Dani Lischinski,et al.  Bounded-distortion piecewise mesh parameterization , 2002, IEEE Visualization, 2002. VIS 2002..

[16]  Bruno Lévy,et al.  Least squares conformal maps for automatic texture atlas generation , 2002, ACM Trans. Graph..

[17]  A. Sheffer Spanning tree seams for reducing parameterization distortion of triangulated surfaces , 2002, Proceedings SMI. Shape Modeling International 2002.

[18]  Ayellet Tal,et al.  Hierarchical mesh decomposition using fuzzy clustering and cuts , 2003, ACM Trans. Graph..