Where and how Ruppert's algorithm fails

DOI10.1016/J.EXCO.2022.100069MaRDI QIDQ6933837zbMATH OpenFDO

Authors Alexander Rand

Publication date 4 September 2025

Published in Examples and Counterexamples (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/J.EXCO.2022.100069

zbMATH Keywords

computational geometryDelaunay triangulationmesh generation

Mathematics Subject Classification ID

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

Cites work

• A 2D advancing-front Delaunay mesh refinement algorithm
• A Delaunay Refinement Algorithm for Quality 2-Dimensional Mesh Generation
• Delaunay refinement algorithms for triangular mesh generation
• Generalized insertion region guides for Delaunay mesh refinement
• LATIN 2004: Theoretical Informatics
• Quality Triangulations with Locally Optimal Steiner Points
• Silver exudation
• WHEN AND WHY DELAUNAY REFINEMENT ALGORITHMS WORK

This page was built for publication: Where and how Ruppert's algorithm fails

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