Space-efficient approximate Voronoi diagrams

DOI10.1145/509907.510011zbMath1192.68727OpenAlexW1973949696MaRDI QIDQ3579252

David M. Mount, Theocharis Malamatos, Sunil Arya

Publication date: 5 August 2010

Published in: Proceedings of the thiry-fourth annual ACM symposium on Theory of computing (Search for Journal in Brave)

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

Mathematics Subject Classification ID

Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Data structures (68P05)

Related Items (10)

Voronoi Diagram and Delaunay Triangulation with Independent and Dependent Geometric Uncertainties ⋮ On Clustering Induced Voronoi Diagrams ⋮ Space-Time Tradeoffs for Proximity Searching in Doubling Spaces ⋮ Approximating nearest neighbor among triangles in convex position ⋮ Deformable spanners and applications ⋮ Faster core-set constructions and data-stream algorithms in fixed dimensions ⋮ Nearest neighbors search using point location in balls with applications to approximate Voronoi decompositions ⋮ Practical methods for shape fitting and kinetic data structures using coresets ⋮ Unnamed Item ⋮ The effect of corners on the complexity of approximate range searching

This page was built for publication: Space-efficient approximate Voronoi diagrams