Vertex removal in two-dimensional Delaunay triangulation: speed-up by low degrees optimization

DOI10.1016/j.comgeo.2010.10.001zbMath1206.65078OpenAlexW2167088534WikidataQ60692845 ScholiaQ60692845MaRDI QIDQ617545

Olivier Devillers

Publication date: 21 January 2011

Published in: Computational Geometry (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.comgeo.2010.10.001

zbMATH Keywords

Voronoi diagramimplementationDelaunay triangulationasymptotic complexitypractical complexity

Mathematics Subject Classification ID

Numerical aspects of computer graphics, image analysis, and computational geometry (65D18) Complexity and performance of numerical algorithms (65Y20)

Related Items (1)

Voronoi Diagram and Delaunay Triangulation with Independent and Dependent Geometric Uncertainties

Uses Software

• OEIS

Cites Work

• Unnamed Item
• A linear-time algorithm for computing the Voronoi diagram of a convex polygon
• ON DELETION IN DELAUNAY TRIANGULATIONS

This page was built for publication: Vertex removal in two-dimensional Delaunay triangulation: speed-up by low degrees optimization