A dynamic data structure for approximate range searching

DOI10.1145/1810959.1811002zbMath1284.68216OpenAlexW2142602416MaRDI QIDQ5405889

Eunhui Park, David M. Mount

Publication date: 3 April 2014

Published in: Proceedings of the twenty-sixth annual symposium on Computational geometry (Search for Journal in Brave)

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

zbMATH Keywords

approximation algorithmsrange searchingquadtreesdynamic data structuresgeometric data structures

Mathematics Subject Classification ID

Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Data structures (68P05) Approximation algorithms (68W25) Combinatorial complexity of geometric structures (52C45)

Related Items (3)

Bounds on the cost of compatible refinement of simplex decomposition trees in arbitrary dimensions ⋮ Conic nearest neighbor queries and approximate Voronoi diagrams ⋮ Crushing Disks Efficiently

This page was built for publication: A dynamic data structure for approximate range searching