On the difficulty of range searching.
From MaRDI portal
Publication:2482904
DOI10.1016/S0925-7721(97)00005-9zbMath1133.68458OpenAlexW2024885603MaRDI QIDQ2482904
Publication date: 25 April 2008
Published in: Computational Geometry (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/s0925-7721(97)00005-9
Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Numerical aspects of computer graphics, image analysis, and computational geometry (65D18) Data structures (68P05)
Related Items (1)
Cites Work
- Unnamed Item
- Unnamed Item
- Efficient worst-case data structures for range searching
- Decomposable searching problems
- Surpassing the information theoretic bound with fusion trees
- Quad trees: A data structure for retrieval by composite keys
- Lower bounds for union-split-find related problems on random access machines
- Lower bounds for orthogonal range searching: I. The reporting case
- Lower bounds for orthogonal range searching: part II. The arithmetic model
- Priority Search Trees
- Filtering Search: A New Approach to Query-Answering
- A Functional Approach to Data Structures and Its Use in Multidimensional Searching
This page was built for publication: On the difficulty of range searching.
