A dynamic data structure for approximate range searching
DOI10.1145/1810959.1811002zbMATH Open1284.68216OpenAlexW2142602416MaRDI QIDQ5405889FDOQ5405889
Authors: David M. Mount, Eunhui Park 
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
Recommendations
Data structures (68P05) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Approximation algorithms (68W25) Combinatorial complexity of geometric structures (52C45)
Cited In (15)
- Efficient regular data structures and algorithms for dilation, location, and proximity problems
- Fully retroactive approximate range and nearest neighbor searching
- Approximate Range Searching in External Memory
- Dynamic range majority data structures
- Conic nearest neighbor queries and approximate Voronoi diagrams
- SKIP QUADTREES: DYNAMIC DATA STRUCTURES FOR MULTIDIMENSIONAL POINT SETS
- Title not available (Why is that?)
- Fixed queries array: A fast and economical data structure for proximity searching
- FSTTCS 2004: Foundations of Software Technology and Theoretical Computer Science
- Space-time tradeoffs for approximate spherical range counting
- Opportunistic data structures for range queries
- An optimal dynamic interval stabbing-MAX data structure?
- Bounds on the cost of compatible refinement of simplex decomposition trees in arbitrary dimensions
- Crushing disks efficiently
- Approximate Range Searching: The Absolute Model
This page was built for publication: A dynamic data structure for approximate range searching
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5405889)
