Practical Papercraft Models from Meshes

We present a new approach to generate papercraft models from meshes. The input mesh is approximated by a set of quadric surface proxies. Each quadric proxy is then cut and unfolded into a 2D papercraft pattern. Our method has the following advantages : First, we produce smoother papercraft models than previous methods. Second, the 2D patterns of papercraft models are easy to cut and glue. Finally, the 2D patterns of papercraft models are more meaningful due to the pre-defined cutting rules. We demonstrate this by physically assembling papercraft models from our algorithm.

[1]  Wolfgang Böhm,et al.  Geometric concepts for geometric design , 1993 .

[2]  Gershon Elber,et al.  Papercraft Models using Generalized Cylinders , 2007 .

[3]  Marco Attene,et al.  Hierarchical mesh segmentation based on fitting primitives , 2006, The Visual Computer.

[4]  David H. Eberly,et al.  Geometric Tools for Computer Graphics , 2002 .

[5]  Gabriel Taubin,et al.  Estimation of Planar Curves, Surfaces, and Nonplanar Space Curves Defined by Implicit Equations with Applications to Edge and Range Image Segmentation , 1991, IEEE Trans. Pattern Anal. Mach. Intell..

[6]  Hao Zhang,et al.  Mesh Segmentation via Spectral Embedding and Contour Analysis , 2007, Comput. Graph. Forum.

[7]  M. Floater.  Mean value coordinates , 2003, Computer Aided Geometric Design.

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

[9]  S. P. Lloyd,et al.  Least squares quantization in PCM , 1982, IEEE Trans. Inf. Theory.

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

[11]  Leif Kobbelt,et al.  Structure Recovery via Hybrid Variational Surface Approximation , 2005, Comput. Graph. Forum.

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

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

[14]  Bruno Lévy,et al.  ABF++: fast and robust angle based flattening , 2005, TOGS.

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

[16]  Jonathan Richard Shewchuk,et al.  Triangle: Engineering a 2D Quality Mesh Generator and Delaunay Triangulator , 1996, WACG.

[17]  Karan Singh,et al.  Extraction and remeshing of ellipsoidal representations from mesh data , 2005, Graphics Interface.

[18]  Gabriel Taubin,et al.  An improved algorithm for algebraic curve and surface fitting , 1993, 1993 (4th) International Conference on Computer Vision.

[19]  Hans-Peter Seidel,et al.  Linear angle based parameterization , 2007, Symposium on Geometry Processing.

[20]  Mark Meyer,et al.  Intrinsic Parameterizations of Surface Meshes , 2002, Comput. Graph. Forum.

[21]  Mathieu Desbrun,et al.  Variational shape approximation , 2004, SIGGRAPH 2004.

[22]  Ayellet Tal,et al.  Mesh segmentation using feature point and core extraction , 2005, The Visual Computer.

[23]  Dong-Ming Yan,et al.  Quadric Surface Extraction by Variational Shape Approximation , 2006, GMP.

[24]  Michael S. Floater,et al.  Parametrization and smooth approximation of surface triangulations , 1997, Comput. Aided Geom. Des..

[25]  Tong-Yee Lee,et al.  Segmenting a deforming mesh into near-rigid components , 2006, The Visual Computer.

[26]  Alla Sheffer,et al.  Parameterization of Faceted Surfaces for Meshing using Angle-Based Flattening , 2001, Engineering with Computers.

[27]  Bao Li,et al.  A Mesh Meaningful Segmentation Algorithm Using Skeleton and Minima-Rule , 2007, ISVC.