A reliable triangular mesh intersection algorithm and its application in geological modelling

We introduce a reliable intersection algorithm for manifold surface meshes. The proposed algorithm builds conforming surface meshes from a set of intersecting triangulated surfaces. This algorithm effectively handles all degenerate triangle–triangle intersection cases. The key idea of the algorithm is based on an extensive set of triangle–edge intersection cases, combined with an intersection curve tracking method. The intersection operations do not rely on global spatial search operations and no remeshing steps are needed. The intersection curves are introduced into each surface mesh using a unique curve imprinting algorithm. The imprinting algorithm naturally handles degenerate intersection cases of many surfaces at an edge or at a point. The algorithm produces a consistent mesh data structure for subsequent mesh optimization operations. The mesh intersection algorithm is used within a general framework for modelling and meshing of geological formations, which are essential for reliable mathematical modelling of oil reservoirs.

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

[2]  Pascal Lienhardt,et al.  Subdivisions of n-dimensional spaces and n-dimensional generalized maps , 1989, SCG '89.

[3]  Luiz Fernando Martha,et al.  Multiple Intersections of Finite-Element Surface Meshes , 2002, IMR.

[4]  William J. Schroeder,et al.  Visualizing with VTK: A Tutorial , 2000, IEEE Computer Graphics and Applications.

[5]  G. Caumon,et al.  Surface-Based 3D Modeling of Geological Structures , 2009 .

[6]  Dinesh Manocha,et al.  OBBTree: a hierarchical structure for rapid interference detection , 1996, SIGGRAPH.

[7]  Ahmed H. Elsheikh,et al.  Semi-formal design of reliable mesh generation systems , 2004 .

[8]  J. Mallet,et al.  Building and Editing a Sealed Geological Model , 2004 .

[9]  Paresh Parikh,et al.  Generation of three-dimensional unstructured grids by the advancing-front method , 1988 .

[10]  Gabriel Courrioux,et al.  Topological and geometric characterization of fault networks using 3-dimensional Generalized maps , 1996 .

[11]  Jacques Carette,et al.  A generative geometric kernel , 2011, PEPM '11.

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

[13]  Jonathan Richard Shewchuk,et al.  Robust adaptive floating-point geometric predicates , 1996, SCG '96.

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

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

[16]  K. -B. Guo,et al.  Boolean operations of STL models based on loop detection , 2007 .

[17]  S. H. Lo,et al.  An algorithm for the intersection of quadrilateral surfaces by tracing of neighbours , 2003 .

[18]  Nigel P. Weatherill,et al.  Enhanced remeshing from STL files with applications to surface grid generation , 2006 .

[19]  Nigel P. Weatherill,et al.  EQSM: An efficient high quality surface grid generation method based on remeshing , 2006 .

[20]  H. Ulmer,et al.  TRICUT: a program to clip triangle meshes using the rapid and triangle libraries and the visualization toolkit , 2002 .

[21]  W. X. Wang,et al.  A fast robust algorithm for the intersection of triangulated surfaces , 2004, Engineering with Computers.