Conforming restricted Delaunay mesh generation for piecewise smooth complexes
Not on the map. Why?
Abstract (arXiv)
A Frontal-Delaunay refinement algorithm for mesh generation in piecewise smooth domains is described. Built using a restricted Delaunay framework, this new algorithm combines a number of novel features, including: (i) an unweighted, conforming restricted Delaunay representation for domains specified as a (non-manifold) collection of piecewise smooth surface patches and curve segments, (ii) a protection strategy for domains containing curve segments that subtend sharply acute angles, and (iii) a new class of off-centre refinement rules designed to achieve high-quality point-placement along embedded curve features. Experimental comparisons show that the new Frontal-Delaunay algorithm outperforms a classical (statically weighted) restricted Delaunay-refinement technique for a number of three-dimensional benchmark problems.
Key facts. Cited by 1 paper in the map (data through 7 Oct 2026). First posted on arXiv 3 Jun 2016.
Builds on
No reference list yet.
Built on by
Citing papers per year: 2022: 1.
1 paper.