A fast robust algorithm for the intersection of triangulated surfaces

The use of discrete data to represent engineering structures as derivatives from intersecting components requires algorithms to perform Boolean operations between groups of triangulated surfaces. In the intersection process, an accurate and efficient method for the determination of intersection lines is a crucial step for large scale and complex surface intersections. An algorithm based on tracing the neighbours of intersecting triangles (TNOIT) is proposed to determine the intersection lines. Given the node numbers at the vertices of the triangles, the neighbour relationship is first established. A background grid is employed to limit the scope of searching for candidate triangles that may intersect. This will drastically reduce the time of geometrical checking for intersections between triangles, making the surface intersection and mesh generation a quasi-linear process with respect to the number of elements involved. In the determination of intersection between two triangles, four fundamental cases are identified and treated systematically to enhance robustness and reliability. Tracing the neighbours for the determination of intersection lines not only greatly increases the efficiency of the process, it also improves the reliability as branching and degenerated cases can all be dealt with in a consistent manner on the intersecting surfaces concerned. Five examples on a great variety of surface and mesh characteristics are given to demonstrate the effectiveness and robustness of the algorithm.

[1]  Marcelo Gattass,et al.  INTERSECTING AND TRIMMING PARAMETRIC MESHES ON FINITE-ELEMENT SHELLS , 2000 .

[2]  Rainald Löhner,et al.  Surface triangulation over intersecting geometries , 1999 .

[3]  Chi King Lee,et al.  Automatic adaptive mesh generation using metric advancing front approach , 1999 .

[4]  Wolfgang Heiden,et al.  Triangulation algorithms for the representation of molecular surface properties , 1990, J. Comput. Aided Mol. Des..

[5]  Herbert Edelsbrunner,et al.  Triangulating the Surface of a Molecule , 1996, Discret. Appl. Math..

[6]  Steven E. Benzley,et al.  GENERALIZED 3-D PAVING : AN AUTOMATED QUADRILATERAL SURFACE MESH GENERATION ALGORITHM , 1996 .

[7]  H. Borouchaki.  AUTOMATIC GENERATION OF FINITE ELEMENT MESHES FOR MOLECULAR SURFACES , 2000 .

[8]  J. Bonet,et al.  An alternating digital tree (ADT) algorithm for 3D geometric searching and intersection problems , 1991 .

[9]  Steven J. Owen,et al.  A Survey of Unstructured Mesh Generation Technology , 1998, IMR.

[10]  Mark S. Shephard,et al.  Automatic three-dimensional mesh generation by the finite octree technique , 1984 .

[11]  R. Löhner.  Regridding Surface Triangulations , 1996 .

[12]  R. E. Hobbs,et al.  Automatic Adaptive Finite Element Mesh Generation Over Rational B-spline Surfaces , 1998 .

[13]  Houman Borouchaki,et al.  Molecular Surface Modeling and Meshing , 2002, Engineering with Computers.

[14]  Cynthia Bruyns,et al.  Interactive cutting of 3D surface meshes , 2001, Comput. Graph..

[15]  Scott A. Canann,et al.  Automatic 3D surface meshing to address today's industrial needs , 1997 .

[16]  S. H. Lo,et al.  Analysis and verification of the boundary surfaces of solid objects , 1998, Engineering with Computers.

[17]  S. Lo.  Automatic mesh generation over intersecting surfaces , 1995 .

[18]  Erich Hartmann,et al.  A marching method for the triangulation of surfaces , 1998, The Visual Computer.

[19]  S. H. Lo,et al.  Finite element mesh generation over analytical curved surfaces , 1996 .

[20]  R Löhner,et al.  Merging of intersecting triangulations for finite element modeling. , 2001, Journal of biomechanics.

[21]  Mark S. Shephard,et al.  Automatic three‐dimensional mesh generation by the finite octree technique , 1984 .

[22]  Jean-Christophe Cuillière.  An adaptive method for the automatic triangulation of 3D parametric surfaces , 1998, Comput. Aided Des..

[23]  Chi King Lee,et al.  Automatic metric advancing front triangulation over curved surfaces , 2000 .

[24]  K. Anastasiou,et al.  Automatic triangular mesh generation scheme for curved surfaces , 1996 .

[25]  P. George,et al.  Parametric surface meshing using a combined advancing-front generalized Delaunay approach , 2000 .

[26]  M. Berger,et al.  Robust and efficient Cartesian mesh generation for component-based geometry , 1998 .

[27]  S. H. Lo,et al.  Finite element mesh generation over curved surfaces , 1988 .