# Conforming restricted Delaunay mesh generation for piecewise smooth complexes

arXiv: https://arxiv.org/abs/1606.01289 · HTML: https://mlsanity.com/paper/1606.01289/

## Key facts

- Cited by 1 papers in the map (data through 14 Oct 2026).
- First posted on arXiv 3 Jun 2016.

## Built on by (most cited first, 1 of 1)

- [Deep Computational Model for the Inference of Ventricular Activation Properties](https://mlsanity.com/paper/2208.04028/) (2022)

## 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.
