Self-improving algorithms for delaunay triangulations

DOI10.1145/1377676.1377700zbMath1221.68262OpenAlexW2065213457MaRDI QIDQ3602908

C. Seshadhri, Kenneth L. Clarkson

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

Mathematics Subject Classification ID

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

Related Items (3)

Delaunay Triangulation of Imprecise Points Simplified and Extended ⋮ Preprocessing imprecise points for Delaunay triangulation: simplified and extended ⋮ A PAC Approach to Application-Specific Algorithm Selection

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