Space-efficient approximate Voronoi diagrams

DOI10.1145/509907.510011MaRDI QIDQ3579252zbMATHOpenAlexFDO

Authors Sunil Arya, Theocharis Malamatos, David M. Mount

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

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

Cited in

(10)

• Faster core-set constructions and data-stream algorithms in fixed dimensions
• Space-Time Tradeoffs for Proximity Searching in Doubling Spaces
• 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
• Deformable spanners and applications
• The effect of corners on the complexity of approximate range searching
• Approximating nearest neighbor among triangles in convex position
• scientific article; zbMATH DE number 7204982 (Why is no real title available?)
• On clustering induced Voronoi diagrams
• Voronoi Diagram and Delaunay Triangulation with Independent and Dependent Geometric Uncertainties

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

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