WHEN AND WHY DELAUNAY REFINEMENT ALGORITHMS WORK

DOI10.1142/S0218195905001592MaRDI QIDQ4676181zbMATH OpenWikidataFDO

Authors Steven E. Pav, Noel J. Walkington, Gary L. Miller

Publication date 3 May 2005

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

Full work available at URL https://doi.org/10.1142/S0218195905001592

zbMATH Keywords

computational geometryDelaunay refinement algorithmMesh generationRuppert's algorithmtriangulation

Mathematics Subject Classification ID

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

Recommendations

• Delaunay refinement algorithms for triangular mesh generation
• Fully Generalized Two-Dimensional Constrained Delaunay Mesh Refinement
• A 2D advancing-front Delaunay mesh refinement algorithm
• scientific article; zbMATH DE number 437532
• Quality Triangulations with Locally Optimal Steiner Points

Cites work

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

Cited in

(8)

• There are simple and robust refinements (almost) as good as Delaunay
• A 2D advancing-front Delaunay mesh refinement algorithm
• On the sizes of Delaunay meshes
• Fully Generalized Two-Dimensional Constrained Delaunay Mesh Refinement
• DELAUNAY REFINEMENT ALGORITHMS FOR ESTIMATING LOCAL FEATURE SIZE IN 2D AND 3D
• Geometrical Mesh Improvement Properties of Delaunay Terminal Edge Refinement
• Where and how Ruppert's algorithm fails
• Delaunay refinement by corner lopping

Describes a project that uses

Uses Software

• Triangle

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4676181)