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.
翻译:我们建议采用两个阶段的算法,在2D和3D中生成Delaunay三边匹配,在最大Poisson-Disk取样点附近使用该方法。该方法在线性运行时产生2和3二维的可变分辨率网格。该算法的有效性通过在离散断裂网络(DFN)上生成一个不结构的 3D 网块来证明。即使Poisson-disk采样方法没有提供超过2个二维的三角质量界限,但我们发现,低质量四面体不够频繁,可以成功去除,以获得高质量平衡的三维模件,并具有表层可接受的四环形。