Self-improving algorithms for delaunay triangulations

DOI10.1145/1377676.1377700zbMATH Open1221.68262OpenAlexW2065213457MaRDI QIDQ3602908FDOQ3602908

Authors: Kenneth L. Clarkson, C. Seshadhri 

Publication date: 12 February 2009

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

Full work available at URL: https://doi.org/10.1145/1377676.1377700

Recommendations

• Self-improving algorithms
• Self-improving algorithms for convex hulls
• A faster divide-and-conquer algorithm for constructing Delaunay triangulations
• Self-improving algorithms for coordinatewise maxima and convex hulls
• A probabilistic result on multi-dimensional Delaunay triangulations, and its application to the 2D case

Mathematics Subject Classification ID

Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Computational aspects related to convexity (52B55)

Cited In (9)

• An empirical comparison of techniques for updating Delaunay triangulations
• A PAC Approach to Application-Specific Algorithm Selection
• Self-improving algorithms
• Delaunay Triangulation of Imprecise Points Simplified and Extended
• Self-improving algorithms for coordinatewise maxima and convex hulls
• Preprocessing imprecise points for Delaunay triangulation: simplified and extended
• Self-improving algorithms for coordinate-wise maxima
• IMPROVING SHORTEST PATHS IN THE DELAUNAY TRIANGULATION
• Self-improving algorithms for convex hulls

This page was built for publication: Self-improving algorithms for delaunay triangulations

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