Computing and Fabricating Multiplanar Models

We present a method for converting computer 3D models into physical equivalents. More specifically, we address the problem of approximating a 3D textured mesh using a small number of planar polygonal primitives that form a closed surface. This simplified representation allows us to easily manufacture individual components using computer controlled cutters (e.g., laser cutters or CNC machines). These polygonal pieces can be assembled into the final 3D model using internal planar connectors that are manufactured simultaneously. Our shape approximation algorithm iteratively assigns mesh faces to planar segments and slowly deforms these faces towards corresponding segments. This approach ensures that the output for a given closed mesh is still a closed mesh and avoids introducing self‐intersections. After this step we also compute the shape of polygonal connectors that internally hold the whole mesh surface. Both the polygonal surface elements and connectors can be manufactured in a single cutting pass. We validate the use of our method by computing and manufacturing a variety of textured polyhedral models.

[1]  David P. Dobkin,et al.  MAPS: multiresolution adaptive parameterization of surfaces , 1998, SIGGRAPH.

[2]  Paolo Cignoni,et al.  A comparison of mesh simplification algorithms , 1998, Comput. Graph..

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

[4]  Dinesh Manocha,et al.  Simplifying polygonal models using successive mappings , 1997, Proceedings. Visualization '97 (Cat. No. 97CB36155).

[5]  Tomohiro Tachi,et al.  Origamizing Polyhedral Surfaces , 2010, IEEE Transactions on Visualization and Computer Graphics.

[6]  Vladimir Kolmogorov,et al.  What energy functions can be minimized via graph cuts? , 2002, IEEE Transactions on Pattern Analysis and Machine Intelligence.

[7]  Marc Alexa,et al.  crdbrd: Shape Fabrication by Sliding Planar Slices , 2012, Comput. Graph. Forum.

[8]  David W. Jacobs,et al.  Mesh saliency , 2005, SIGGRAPH 2005.

[9]  Takeo Igarashi,et al.  SketchChair: an all-in-one chair design system for end users , 2011, Tangible and Embedded Interaction.

[10]  Vladimir Kolmogorov,et al.  An Experimental Comparison of Min-Cut/Max-Flow Algorithms for Energy Minimization in Vision , 2004, IEEE Trans. Pattern Anal. Mach. Intell..

[11]  Pierre Alliez,et al.  Variational shape approximation , 2004, ACM Trans. Graph..

[12]  Frédo Durand,et al.  Billboard clouds for extreme model simplification , 2003, ACM Trans. Graph..

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

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

[15]  Shi-Min Hu,et al.  A geometric study of v-style pop-ups: theories and algorithms , 2011, ACM Trans. Graph..

[16]  Jovan Popovic,et al.  Deformation transfer for triangle meshes , 2004, ACM Trans. Graph..

[17]  Erik D. Demaine,et al.  Geometric folding algorithms - linkages, origami, polyhedra , 2007 .

[18]  Hugues Hoppe,et al.  New quadric metric for simplifying meshes with appearance attributes , 1999, Proceedings Visualization '99 (Cat. No.99CB37067).

[19]  Sergei Vassilvitskii,et al.  k-means++: the advantages of careful seeding , 2007, SODA '07.

[20]  Shi-Min Hu,et al.  Popup: automatic paper architectures from 3D models , 2010, ACM Trans. Graph..

[21]  Ronald Fedkiw,et al.  Robust treatment of collisions, contact and friction for cloth animation , 2002, SIGGRAPH Courses.

[22]  Jovan Popović,et al.  Deformation transfer for triangle meshes , 2004, SIGGRAPH 2004.

[23]  Barbara Cutler,et al.  Constrained planar remeshing for architecture , 2007, GI '07.

[24]  David P. Dobkin,et al.  Multiresolution mesh morphing , 1999, SIGGRAPH.

[25]  Daniele Panozzo,et al.  Automatic Construction of Quad-Based Subdivision Surfaces Using Fitmaps , 2011, IEEE Transactions on Visualization and Computer Graphics.

[26]  David W. Jacobs,et al.  Mesh saliency , 2005, ACM Trans. Graph..

[27]  Pedro V. Sander,et al.  Texture mapping progressive meshes , 2001, SIGGRAPH.

[28]  Olga Sorkine-Hornung,et al.  Interference-aware geometric modeling , 2011, ACM Trans. Graph..

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

[30]  Wojciech Matusik,et al.  Computing and fabricating multilayer models , 2011, ACM Trans. Graph..

[31]  Shi-Min Hu,et al.  A geometric study of v-style pop-ups: theories and algorithms , 2011, SIGGRAPH 2011.

[32]  Vladimir Kolmogorov,et al.  An experimental comparison of min-cut/max- flow algorithms for energy minimization in vision , 2001, IEEE Transactions on Pattern Analysis and Machine Intelligence.

[33]  Pat Hanrahan,et al.  Designing effective step-by-step assembly instructions , 2003, ACM Trans. Graph..

[34]  Andrew S. Glassner Interactive Pop-up Card Design, Part I , 2002, IEEE Computer Graphics and Applications.

[35]  Dinesh Manocha,et al.  Interactive surface decomposition for polyhedral morphing , 1999, The Visual Computer.

[36]  Dinesh Manocha,et al.  Appearance-preserving simplification , 1998, SIGGRAPH.

[37]  Niloy J. Mitra,et al.  Slices: a shape-proxy based on planar sections , 2011, ACM Trans. Graph..

[38]  Steven J. Gortler,et al.  Geometry images , 2002, SIGGRAPH.

[39]  Andrei Khodakovsky,et al.  Globally smooth parameterizations with low distortion , 2003, ACM Trans. Graph..