DELAUNAY REFINEMENT ALGORITHMS FOR ESTIMATING LOCAL FEATURE SIZE IN 2D AND 3D

ALEXANDER RAND, NOEL WALKINGTON
2011 International journal of computational geometry and applications  
We present Delaunay refinement algorithms for estimating local feature on the 0-skeleton of a 2D piecewise linear complex (2D) and on the 1-skeleton of a 3D PLC. These algorithms are designed to eliminate the need for a local feature size oracle in quality mesh generation of domains containing acute input angles. In keeping with Ruppert's algorithm, encroachment in these algorithms can be determined through only local information in the current Delaunay triangulation. The algorithms are simple
more » ... nough to be implemented and several examples are given.
doi:10.1142/s0218195911003780 fatcat:lrorbfnsijb2zjx35w3duu4jqq