Space-efficient approximate Voronoi diagrams

DOI10.1145/509907.510011zbMATH Open1192.68727OpenAlexW1973949696MaRDI QIDQ3579252FDOQ3579252

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)

• Practical methods for shape fitting and kinetic data structures using coresets
• Approximating nearest neighbor among triangles in convex position
• Title not available (Why is that?)
• The effect of corners on the complexity of approximate range searching
• 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
• On clustering induced Voronoi diagrams
• Space-Time Tradeoffs for Proximity Searching in Doubling Spaces
• Deformable spanners and applications
• 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)