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

DOI10.1016/J.COMGEO.2010.10.001zbMATH Open1206.65078OpenAlexW2167088534WikidataQ60692845 ScholiaQ60692845MaRDI QIDQ617545FDOQ617545

Authors: 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

Recommendations

• scientific article; zbMATH DE number 2079354
• Vertex deletion for 3D Delaunay triangulations
• ON DELETION IN DELAUNAY TRIANGULATIONS
• Fully dynamic Delaunay triangulation in logarithmic expected per operation
• scientific article; zbMATH DE number 177537

zbMATH Keywords

Delaunay triangulationimplementationVoronoi diagramasymptotic complexitypractical complexity

Mathematics Subject Classification ID

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

Cites Work

• Title not available (Why is that?)
• A linear-time algorithm for computing the Voronoi diagram of a convex polygon
• ON DELETION IN DELAUNAY TRIANGULATIONS

Cited In (5)

• Dilation-Optimal Edge Deletion in Polygonal Cycles
• ON DELETION IN DELAUNAY TRIANGULATIONS
• Title not available (Why is that?)
• Vertex deletion for 3D Delaunay triangulations
• Voronoi Diagram and Delaunay Triangulation with Independent and Dependent Geometric Uncertainties

Uses Software

• OEIS

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

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