Delaunay triangulations of imprecise pointsin linear time after preprocessing

DOI10.1145/1377676.1377727zbMath1271.68235OpenAlexW2089615699WikidataQ56970310 ScholiaQ56970310MaRDI QIDQ3602931

Jack Scott Snoeyink, Maarten Löffler

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.1377727

zbMATH Keywords

Delaunay triangulationEuclidean minimum spanning treeGabriel graph

Mathematics Subject Classification ID

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

Related Items (6)

On the Power of the Semi-Separated Pair Decomposition ⋮ Delaunay Triangulation of Imprecise Points Simplified and Extended ⋮ Voronoi Diagram and Delaunay Triangulation with Independent and Dependent Geometric Uncertainties ⋮ (Approximate) uncertain skylines ⋮ Convex hulls under uncertainty ⋮ On the power of the semi-separated pair decomposition

This page was built for publication: Delaunay triangulations of imprecise pointsin linear time after preprocessing