Indirect Unstructured Hex-dominant Mesh Generation Using Tetrahedra Recombination

in: Computational Geosciences, 20:3 (437-451)

Abstract

Corner-point gridding of reservoir and basin models is widely used but generally yields approximations in the geological interfaces representation in flow simulation. This paper introduces an indirect method to generate a hexdominant mesh conformal to 3D geological surfaces suitable for Finite-Element and Control-Volume Finite-Element simulations. By indirect, we mean that the method first generates an unstructured tetrahedral mesh whose tetrahedra are then merged into primitives (hexahedra, prisms and pyramids). More specifically, we focus on determining the optimal set of primitives that can be recombined from a given tetrahedral mesh. First, we detect in the tetrahedral mesh all the feasible volumetric primitives using a pattern-matching algorithm that we re-visit and extend with configurations that account for degenerated tetrahedra (slivers). Then, we observe that selecting the optimal set of primitives among the feasible ones can be formalized as a maximum weighted independent set problem, known to be N P-Complete. We propose five heuristic optimizations to find a reasonable set of primitives in a practical time. All the tetrahedra of each selected primitive are then merged to build the final unstructured hex-dominant mesh. This method is demonstrated on complex 3D geological models including a discrete fracture network.

Download / Links

BibTeX Reference

@article{botella:hal-01301871,
 abstract = {Corner-point gridding of reservoir and basin models is widely used but generally yields approximations in the geological interfaces representation in flow simulation. This paper introduces an indirect method to generate a hexdominant mesh conformal to 3D geological surfaces suitable for Finite-Element and Control-Volume Finite-Element simulations. By indirect, we mean that the method first generates an unstructured tetrahedral mesh whose tetrahedra are then merged into primitives (hexahedra, prisms and pyramids). More specifically, we focus on determining the optimal set of primitives that can be recombined from a given tetrahedral mesh. First, we detect in the tetrahedral mesh all the feasible volumetric primitives using a pattern-matching algorithm that we re-visit and extend with configurations that account for degenerated tetrahedra (slivers). Then, we observe that selecting the optimal set of primitives among the feasible ones can be formalized as a maximum weighted independent set problem, known to be N P-Complete. We propose five heuristic optimizations to find a reasonable set of primitives in a practical time. All the tetrahedra of each selected primitive are then merged to build the final unstructured hex-dominant mesh. This method is demonstrated on complex 3D geological models including a discrete fracture network.},
 author = {Botella, Arnaud and L{\'e}vy, Bruno and Caumon, Guillaume},
 doi = {10.1007/s10596-015-9484-9},
 hal_id = {hal-01301871},
 hal_version = {v1},
 journal = {{Computational Geosciences}},
 keywords = {Meshing ; Hex-dominant ; Recombination ; Mixed-element mesh ; Graph theory},
 number = {3},
 pages = {437-451},
 publisher = {{Springer Verlag}},
 title = {{Indirect Unstructured Hex-dominant Mesh Generation Using Tetrahedra Recombination}},
 url = {https://hal.univ-lorraine.fr/hal-01301871},
 volume = {20},
 year = {2016}
}