WHEN AND WHY DELAUNAY REFINEMENT ALGORITHMS WORK

DOI10.1142/S0218195905001592zbMath1070.65015WikidataQ29999692 ScholiaQ29999692MaRDI QIDQ4676181

Steven E. Pav, Noel J. Walkington, Gary Lee Miller

Publication date: 3 May 2005

Published in: International Journal of Computational Geometry & Applications (Search for Journal in Brave)

zbMATH Keywords

triangulationcomputational geometryMesh generationDelaunay refinement algorithmRuppert's algorithm

Mathematics Subject Classification ID

Numerical aspects of computer graphics, image analysis, and computational geometry (65D18)

Related Items (2)

A 2D advancing-front Delaunay mesh refinement algorithm ⋮ On the sizes of Delaunay meshes

Uses Software

• Triangle

Cites Work

• On the Angle Condition in the Finite Element Method
• A Robust Implementation for Three-Dimensional Delaunay Triangulations
• Guaranteed-quality triangular mesh generation for domains with curved boundaries

This page was built for publication: WHEN AND WHY DELAUNAY REFINEMENT ALGORITHMS WORK