HAL Id: hal-01896881
https://hal.inria.fr/hal-01896881
Submitted on 18 Oct 2018
HAL is a multi-disciplinary open access archive for the deposit and dissemination of sci- entific research documents, whether they are pub- lished or not. The documents may come from teaching and research institutions in France or abroad, or from public or private research centers.
L’archive ouverte pluridisciplinaire HAL, est destinée au dépôt et à la diffusion de documents scientifiques de niveau recherche, publiés ou non, émanant des établissements d’enseignement et de recherche français ou étrangers, des laboratoires publics ou privés.
Simulations in large tridimensional Discrete Fracture Networks (DFN): I. Geometric modeling and mesh
generation
Patrick Laug, Géraldine Pichot
To cite this version:
Patrick Laug, Géraldine Pichot. Simulations in large tridimensional Discrete Fracture Networks
(DFN): I. Geometric modeling and mesh generation. MASCOT 2018 - 15th IMACS/ISGG meet-
ing on applied scientific computing and tools, Oct 2018, Rome, Italy. pp.1-2. �hal-01896881�
Simulations in large tridimensional Discrete Fracture Networks (DFN):
I. Geometric modeling and mesh generation
Patrick Laug 1 , G´ eraldine Pichot 2
1
Inria Saclay ˆIle-de-France, France
2
Inria Paris, France
Fractures in the Earth’s subsurface have a strong impact in many physical and chemical phenomena, as their properties (in particular their permeabil- ities) are very different from those of the surrounding rocks. They play a major role in diverse fields of applications such as groundwater extraction, oil and gas exploitation, geothermal energy production, CO2 sequestration, etc. In this presentation, we focus on the well-known Discrete Fracture Net- work (DFN) models and on efficient techniques to mesh them. The generated meshes are subsequently used to carry out numerical simulations
∗.
In the DFN models [1, 2, 3, 4], fractures are represented by ellipses that are randomly generated in the tridimensional space, following experimental statistics. To make this model suitable for classical surface and volume mesh- ers [5, 6], it is necessary to add some information, which is accomplished in several steps: computation of the intersections between fractures, selection of fractures using a graph structure, and construction of a conforming set of edges that can be used as input for a mesh generator. All these steps present special difficulties if there are large numbers of fractures with dis- tances, lengths and angles spanning over several orders of magnitude. Com- putational times are also critical, and only linear time algorithms can be accepted. In this talk, a methodology for modeling and meshing DFNs will be presented, and recent meshes up to hundreds of thousands of fractures will be shown.
∗