Delaunay Refinement by Corner Lopping

Proceedings, 14th International Meshing Roundtable, Springer-Verlag, pp.165-182, September 11-14 2005

MESHING
RESEARCH
CORNER

14th International Meshing Roundtable
San Diego, CA, USA
September 11-14, 2005

Steven E. Pav
University of California at San Diego, La Jolla, CA.
spav@ucsd.edu

Noel J. Walkington
Carnegie Mellon University, Pittsburgh, PA.
noelw@andrew.cmu.edu

Abstract
An algorithm for quality Delaunay meshing of 2D domains with curved boundaries is presented. The algorithm uses Ruppert’s "corner lopping" heuristic. In addition to admitting a simple termination proof, the algorithm can accept curved input without any bound on the tangent angle between adjoining curves. In the limit case, where all curves are straight line segments, the algorithm returns a mesh with a minimum angle of arcsin (1/2root2), except "near" input corners. Some loss of output quality is experienced with the use of curved input, but this loss is diminished for smaller input curvature.

Download Full Paper (PDF Format)