Variable resolution Poisson-disk sampling for meshing discrete fracture networks

@article{Krotz2022VariableRP,
  title={Variable resolution Poisson-disk sampling for meshing discrete fracture networks},
  author={Johannes Krotz and Matthew R. Sweeney and Jeffrey De'Haven Hyman and Juan M. Restrepo and Carl W. Gable},
  journal={J. Comput. Appl. Math.},
  year={2022},
  volume={407},
  pages={114094}
}
A Comparison of Linear Solvers for Resolving Flow in Three‐Dimensional Discrete Fracture Networks
TLDR
Generally, Cholesky factorization is recommended, but conjugate gradients (CG) with an AMG preconditioner may be suitable for very large problems beyond 40 million nodes where the entire linear system cannot reside in memory.

References

SHOWING 1-10 OF 73 REFERENCES
Conforming Delaunay Triangulation of Stochastically Generated Three Dimensional Discrete Fracture Networks: A Feature Rejection Algorithm for Meshing Strategy
TLDR
The feature rejection algorithm for meshing (FRAM) is introduced to generate a high quality conforming Delaunay triangulation of a three-dimensional discrete fracture network (DFN) by prescribing a minimum length scale and then restricting the generation of the network to only create features of that size and larger.
Efficient and good Delaunay meshes from random points
A Generalized Mixed Hybrid Mortar Method for Solving Flow in Stochastic Discrete Fracture Networks
TLDR
A new method generalizing the previous one and that is applicable for stochastic networks is designed, which makes it easy to perform mesh optimization and appears to be a very promising tool to simulate flow in multiscale fracture networks.
Flow Simulation in Three-Dimensional Discrete Fracture Networks
TLDR
This work develops a general and efficient stochastic numerical model for discrete fracture networks (DFNs) in a three-dimensional (3D) computational domain and presents an original conforming mesh generation method addressing the penalizing configurations stemming from close fractures and acute angles between fracture intersections.
Guaranteed-quality Delaunay meshing in 3D (short version)
  • L. Chew
  • Computer Science
    SCG '97
  • 1997
TLDR
Thk is the first Delaunay-based method that is mathematically guaranteed to avoid slivers in mesh generation, and makes use of the Empty Circle Property for the DT of a set of point sites: the circumcircle of each triangle is empty of all other sites.
A Delaunay based numerical method for three dimensions: generation, formulation, and partition
TLDR
The results show that the bounded radius-edge ratio property is desirable for well-shaped triangular meshes for numerical methods such as finite element, finite difference, and in particular, finite volume methods.
A mixed hybrid Mortar method for solving flow in discrete fracture networks
TLDR
This article shows how MHFEM is well adapted for integrating a Mortar method to enforce the continuity of the fluxes and heads at the non-matching grids.
A New Approach to Simulating Flow in Discrete Fracture Networks with an Optimized Mesh
TLDR
The principal aim of this article is to present a tool to slowly modify the structures of the fracture networks to have a good quality mesh with a marginal loss in precision.
Control Volume Meshes Using Sphere Packing
  • G. Miller
  • Computer Science, Physics
    IRREGULAR
  • 1998
We present a sphere-packing technique for Delaunay-based mesh generation, refinement and coarsening. We have previously established that a bounded radius of ratio of circumscribed sphere to smallest
...
1
2
3
4
5
...