Structure Preserving CAD Model Repair

There are two major approaches for converting a tessellated CAD model that contains inconsistencies like cracks or intersections into a manifold and closed triangle mesh. Surface oriented algorithms try to x the inconsistencies by perturbing the input only slightly, but they often cannot handle special cases. Volumetric algorithms on the other hand produce guaranteed manifold meshes but mostly destroy the structure of the input tessellation due to global resampling. In this paper we combine the advantages of both approaches: We exploit the topological simplicity of a voxel grid to reconstruct a cleaned up surface in the vicinity of intersections and cracks, but keep the input tessellation in regions that are away from these inconsistencies. We are thus able to preserve any characteristic structure (i.e. iso-parameter or curvature lines) that might be present in the input tessellation. Our algorithm closes gaps up to a user-dened maximum diameter, resolves intersections, handles incompatible patch orientations and produces a feature-sensitive, manifold output that stays within a prescribed error-tolerance to the input model.

[1]  David L. Bourell,et al.  Solid Freeform Fabrication Symposium Proceedings , 1993 .

[2]  Mario Botsch,et al.  Feature sensitive surface extraction from volume data , 2001, SIGGRAPH.

[3]  Georges G. Grinstein,et al.  Proceedings of the 2nd conference on Visualization '91 , 1991 .

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

[5]  Michael J. Wozny,et al.  Automatic CAD-model Repair: Shell-Closure , 1992 .

[6]  William E. Lorensen,et al.  Marching cubes: A high resolution 3D surface construction algorithm , 1987, SIGGRAPH.

[7]  Tao Ju Robust repair of polygonal models , 2004, SIGGRAPH 2004.

[8]  Douglas M. Priest,et al.  Algorithms for arbitrary precision floating point arithmetic , 1991, [1991] Proceedings 10th IEEE Symposium on Computer Arithmetic.

[9]  M. Levas OBBTree : A Hierarchical Structure for Rapid Interference Detection , .

[10]  Suhas N. Diggavi,et al.  Efficient Max-Norm Distance Computation for Reliable Voxelization , 2003, Symposium on Geometry Processing.

[11]  Marc Levoy,et al.  Zippered polygon meshes from range images , 1994, SIGGRAPH.

[12]  Steve Marschner,et al.  Filling holes in complex surfaces using volumetric diffusion , 2002, Proceedings. First International Symposium on 3D Data Processing Visualization and Transmission.

[13]  Zoë J. Wood,et al.  Topological Noise Removal , 2001, Graphics Interface.

[14]  Bernd Hamann,et al.  The asymptotic decider: resolving the ambiguity in marching cubes , 1991, Proceeding Visualization '91.

[15]  Peter Liepa,et al.  Filling Holes in Meshes , 2003, Symposium on Geometry Processing.

[16]  Greg Turk,et al.  Simplification and Repair of Polygonal Models Using Volumetric Techniques , 2003, IEEE Trans. Vis. Comput. Graph..

[17]  Sarah F. Frisken Using Distance Maps for Accurate Surface Representation in Sampled Volumes , 1998, VVS.

[18]  Tao Ju,et al.  Robust repair of polygonal models , 2004, ACM Trans. Graph..

[19]  Jonathan Richard Shewchuk,et al.  Adaptive Precision Floating-Point Arithmetic and Fast Robust Geometric Predicates , 1997, Discret. Comput. Geom..

[20]  Jules Bloomenthal,et al.  Polygonization of implicit surfaces , 1988, Comput. Aided Geom. Des..

[21]  Gabriel Taubin,et al.  Cutting and Stitching: Converting Sets of Polygons to Manifold Surfaces , 2001, IEEE Trans. Vis. Comput. Graph..

[22]  Peter Lindstrom,et al.  Out-of-core simplification of large polygonal models , 2000, SIGGRAPH.

[23]  A. Dolenc,et al.  Some Efficient Procedures for Correcting Triangulated Models , 1993 .

[24]  Gabriel Taubin,et al.  A signal processing approach to fair surface design , 1995, SIGGRAPH.

[25]  Leif Kobbelt,et al.  Sub‐Voxel Topology Control for Level‐Set Surfaces , 2003, Comput. Graph. Forum.

[26]  Tao Ju,et al.  Dual contouring of hermite data , 2002, ACM Trans. Graph..

[27]  Carlos Andújar,et al.  Topology-reducing surface simplification using a discrete solid representation , 2002, TOGS.

[28]  Subodh Kumar,et al.  RSVP: A Geometric Toolkit for Controlled Repair of Solid Models , 1998, IEEE Trans. Vis. Comput. Graph..

[29]  Micha Sharir,et al.  Filling gaps in the boundary of a polyhedron , 1995, Comput. Aided Geom. Des..

[30]  Ronald N. Perry,et al.  Adaptively sampled distance fields: a general representation of shape for computer graphics , 2000, SIGGRAPH.

[31]  Jarek Rossignac,et al.  Optimizing the topological and combinatorial complexity of isosurfaces , 2005, Comput. Aided Des..

[32]  William E. Lorensen,et al.  Marching cubes: a high resolution 3D surface construction algorithm , 1996 .

[33]  Jonathan Richard Shewchuk Adaptive Precision Floating-Point Arithmetic and Fast Robust Geometric Predicates , 1997 .