Optimized Topological Surgery for Unfolding 3D Meshes

Constructing a 3D papercraft model from its unfolding has been fun for both children and adults since we can reproduce virtual 3D models in the real world. However, facilitating the papercraft construction process is still a challenging problem, especially when the shape of the input model is complex in the sense that it has large variation in its surface curvature. This paper presents a new heuristic approach to unfolding 3D triangular meshes without any shape distortions, so that we can construct the 3D papercraft models through simple atomic operations for gluing boundary edges around the 2D unfoldings. Our approach is inspired by the concept of topological surgery, where the appearance of boundary edges of the unfolded closed surface can be encoded using a symbolic representation. To fully simplify the papercraft construction process, we developed a genetic‐based algorithm for unfolding the 3D mesh into a single connected patch in general, while optimizing the usage of the paper sheet and balance in the shape of that patch. Several examples together with user studies are included to demonstrate that the proposed approach works well for a broad range of 3D triangular meshes.

[1]  Hartmut Prautzsch,et al.  Creating Optimized Cut-Out Sheets for Paper Models from Meshes , 2011 .

[2]  Hans-Peter Seidel,et al.  Mesh segmentation driven by Gaussian curvature , 2005, The Visual Computer.

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

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

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

[6]  M. Douglas McIlroy,et al.  Getting raster ellipses right , 1992, TOGS.

[7]  Erik D. Demaine,et al.  A Survey of Folding and Unfolding in Computational Geometry , 2007 .

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

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

[10]  Marco Attene,et al.  Mesh Segmentation - A Comparative Study , 2006, IEEE International Conference on Shape Modeling and Applications 2006 (SMI'06).

[11]  David Eppstein,et al.  Single-strip triangulation of manifolds with arbitrary topology , 2004, SCG '04.

[12]  John C. Hart,et al.  Seamster: inconspicuous low-distortion texture seam layout , 2002, IEEE Visualization, 2002. VIS 2002..

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

[14]  Alla Sheffer,et al.  D‐Charts: Quasi‐Developable Mesh Segmentation , 2005, Comput. Graph. Forum.

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

[16]  Kai Hormann,et al.  Surface Parameterization: a Tutorial and Survey , 2005, Advances in Multiresolution for Geometric Modelling.

[17]  Gershon Elber,et al.  Papercraft Models using Generalized Cylinders , 2007, 15th Pacific Conference on Computer Graphics and Applications (PG'07).

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

[19]  W. Massey.  A basic course in algebraic topology , 1991 .

[20]  Ayellet Tal,et al.  Paper craft models from meshes , 2006, The Visual Computer.

[21]  G. C. Shephard.  Convex polytopes with convex nets , 1975, Mathematical Proceedings of the Cambridge Philosophical Society.