A time-optimal delaunay refinement algorithm in two dimensions

DOI10.1145/1064092.1064128zbMath1380.68399arXivcs/0501007OpenAlexW1993541846MaRDI QIDQ5370616

Alper Üngör, Sariel Har-Peled

Publication date: 20 October 2017

Published in: Proceedings of the twenty-first annual symposium on Computational geometry (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/cs/0501007

zbMATH Keywords

quadtreeSteiner pointsmesh refinementDelaunay triangulationmesh quality

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Steiner systems in finite geometry (51E10)

Related Items (3)

Dynamic well-spaced point sets ⋮ Combining improvement and refinement techniques: 2D Delaunay mesh adaptation under domain changes ⋮ Off-centers: A new type of Steiner points for computing size-optimal quality-guaranteed Delaunay triangulations

This page was built for publication: A time-optimal delaunay refinement algorithm in two dimensions