Maximal Poisson-disk Sampling for Variable Resolution Conforming Delaunay Mesh Generation: Applications for Three-Dimensional Discrete Fracture Networks and the Surrounding Vol

by   Johannes Krotz, et al.

We propose a two-stage algorithm for generating Delaunay triangulations in 2D and Delaunay tetrahedra in 3D that employs near maximal Poisson-disk sampling. The method generates a variable resolution mesh in 2- and 3-dimensions in linear run time. The effectiveness of the algorithm is demonstrated by generating an unstructured 3D mesh on a discrete fracture network (DFN). Even though Poisson-disk sampling methods do not provide triangulation quality bounds in more than two-dimensions, we found that low quality tetrahedra are infrequent enough and could be successfully removed to obtain high quality balanced three-dimensional meshes with topologically acceptable tetrahedra.


page 12

page 13

page 19

page 20

page 27


Variable resolution Poisson-disk sampling for meshing discrete fracture networks

We present the near-Maximal Algorithm for Poisson-disk Sampling (nMAPS) ...

k-d Darts: Sampling by k-Dimensional Flat Searches

We formalize the notion of sampling a function using k-d darts. A k-d da...

Gap Processing for Adaptive Maximal Poisson-Disk Sampling

In this paper, we study the generation of maximal Poisson-disk sets with...

Conformal marked bisection for local refinement of n-dimensional unstructured simplicial meshes

We present an n-dimensional marked bisection method for unstructured con...

A Feature-aware SPH for Isotropic Unstructured Mesh Generation

In this paper, we present a feature-aware SPH method for the concurrent ...

Massive Uniform Mesh Decimation via a Fast Intrinsic Delaunay Triangulation

Triangular meshes are still today the data structure at the main foundat...

Tight bounds for popping algorithms

We sharpen run-time analysis for algorithms under the partial rejection ...

Please sign up or login with your details

Forgot password? Click here to reset