Functional Delaunay Refinement

Numerical Grid Generation in Computational Field Simulations, The International Society of Grid Generation, pp.253-262, September 2000

MESHING
RESEARCH
CORNER

Abstract

Given a complex of vertices, constraining segments, (and planar straight-line constraining facets in 3D) and an α-Lipschitz control spacing function f () over the domain, an algorithm presented herein can generate a conforming mesh of Delaunay triangles (tetrahedra in 3D) whose circumradius-to-shortest-edge ratios are no greater than the square root of 2 (2 in 3D). The triangle (tetrahedron) size is within a constant factor of f (). An implementation in 2D demonstrates that the algorithm generates excellent mesh.