Delaunay triangulations in O (sort( n )) time and more

DOI10.1145/1944345.1944347zbMath1327.68311OpenAlexW2161679356MaRDI QIDQ3016253

Wolfgang Mulzer, Kevin Buchin

Publication date: 14 July 2011

Published in: Journal of the ACM (Search for Journal in Brave)

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

zbMATH Keywords

convex hullDelaunay triangulationword RAM

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Computational aspects related to convexity (52B55) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Data structures (68P05)

Related Items (6)

Four Soviets walk the dog: improved bounds for computing the Fréchet distance ⋮ Near-linear-time deterministic plane Steiner spanners for well-spaced point sets ⋮ A faster algorithm for computing motorcycle graphs ⋮ Unnamed Item ⋮ Preprocessing Ambiguous Imprecise Points ⋮ Dynamic smooth compressed quadtrees

This page was built for publication: Delaunay triangulations in O (sort( n )) time and more