Generative Design Conversion to Editable and Watertight Boundary Representation

Abstract We present the first, to our knowledge, fully automatic method for the conversion of a general generative design to a watertight B-Rep composed of the exact residual geometry of the input solids and editable T-NURCC surfaces. The design can be synthesized by any combination of both additive and subtractive in-synthesis processes, and constrained by any number of keep-in and -out solids. Our method requires only the input generative setup solids, rudimentary data from the solve, and a boundary mesh of the optimized design. Leveraging the generative solve data, we augment the boundary mesh with “incidence” attributes linking it to the input solids, and partition it into organic and incident regions. The organic regions are parameterized and approximated with T-NURCCs. Then, their boundaries are “pulled” into the adjacent input solids to construct clean intersection curves. Finally, the organic surfaces are combined with the input solids to compose a watertight solid B-Rep of the generative design. Without such an automatic conversion, users seeking to exploit generative designs in downstream workflows (e.g. setting up assembly constraints, simulation analyses, performing parametric edits) have to manually convert the design to a B-Rep, slowing down the path to manufacturing and increasing the product time to market. As a result of our work, engineers can now quickly obtain useful CAD models of any number of generative designs computed by a variety of algorithms, settings and iterations.

[1]  George Merrill Chaikin,et al.  An algorithm for high-speed curve generation , 1974, Comput. Graph. Image Process..

[2]  Chandrajit L. Bajaj,et al.  Reconstructing Surfaces and Functions on Surfaces from Unorganized Three-Dimensional Data , 1997, Algorithmica.

[3]  Pierre Alliez,et al.  Integer-grid maps for reliable quad meshing , 2013, ACM Trans. Graph..

[4]  Bopaya Bidanda,et al.  Review of reverse engineering systems – current state of the art , 2017 .

[5]  M. Bendsøe Optimal shape design as a material distribution problem , 1989 .

[6]  Haisheng Li,et al.  Variational reconstruction using subdivision surfaces with continuous sharpness control , 2017, Computational Visual Media.

[7]  E. Catmull,et al.  Recursively generated B-spline surfaces on arbitrary topological meshes , 1978 .

[8]  Mark Meyer,et al.  Discrete Differential-Geometry Operators for Triangulated 2-Manifolds , 2002, VisMath.

[9]  Marc Pouget,et al.  Estimating differential quantities using polynomial fitting of osculating jets , 2003, Comput. Aided Geom. Des..

[10]  Matthew Ming-Fai Yuen,et al.  Blending of mesh objects to parametric surface , 2015, Comput. Graph..

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

[12]  Monica Carfagni,et al.  Reverse engineering modeling methods and tools: a survey , 2018 .

[13]  David Bommes,et al.  Quantized global parametrization , 2015, ACM Trans. Graph..

[14]  Eitan Grinspun,et al.  Computing discrete shape operators on general meshes , 2006, Comput. Graph. Forum.

[15]  Jean-Pierre Kruth,et al.  Reverse engineering modelling of free-form surfaces from point clouds subject to boundary conditions , 1998 .

[16]  Edmond Boyer,et al.  Implicit B-Spline Surface Reconstruction , 2015, IEEE Transactions on Image Processing.

[17]  Ming C. Lin,et al.  Accurate and Fast Proximity Queries Between Polyhedra Using Convex Surface Decomposition , 2001, Comput. Graph. Forum.

[18]  Pierre Alliez,et al.  Periodic global parameterization , 2006, TOGS.

[19]  Leif Kobbelt,et al.  Optimization methods for scattered data approximation with subdivision surfaces , 2005, Graph. Model..

[20]  Dong-Ming Yan,et al.  Variational mesh segmentation via quadric surface fitting , 2012, Comput. Aided Des..

[21]  Kurt Mehlhorn,et al.  Boolean Operations on 3D Selective Nef Complexes: Data Structure, Algorithms, and Implementation , 2003, ESA.

[22]  Denis Zorin,et al.  Robust field-aligned global parametrization , 2014, ACM Trans. Graph..

[23]  Keenan Crane,et al.  Globally optimal direction fields , 2013, ACM Trans. Graph..

[24]  Dennis S. Arnon,et al.  A cellular decomposition algorithm for semi-algebraic sets , 1979, EUROSAM.

[25]  Pierre Alliez,et al.  A Survey of Surface Reconstruction from Point Clouds , 2017, Comput. Graph. Forum.

[26]  Marcel Campen,et al.  Quad Layout Embedding via Aligned Parameterization , 2014, Comput. Graph. Forum.

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

[28]  Ralph R. Martin,et al.  Algorithms for reverse engineering boundary representation models , 2001, Comput. Aided Des..

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

[30]  Marco Attene,et al.  Recent Advances in Remeshing of Surfaces , 2008, Shape Analysis and Structuring.

[31]  Ross T. Whitaker,et al.  Partitioning 3D Surface Meshes Using Watershed Segmentation , 1999, IEEE Trans. Vis. Comput. Graph..

[32]  Zhigeng Pan,et al.  A direct approach for subdivision surface fitting from a dense triangle mesh , 2004, Comput. Aided Des..

[33]  Walter Nef Beiträge zur Theorie der Polyeder : mit Anwendungen in der Computergraphik , 1978 .

[34]  Bruno Lévy,et al.  Quad‐Mesh Generation and Processing: A Survey , 2013, Comput. Graph. Forum.