Efficient worst-case data structures for range searching
From MaRDI portal
Publication:1134522
DOI10.1007/BF00263991zbMath0423.68029OpenAlexW2060733691MaRDI QIDQ1134522
Jon Louis Bentley, Hermann Maurer
Publication date: 1980
Published in: Acta Informatica (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/bf00263991
Analysis of algorithms and problem complexity (68Q25) Discrete mathematics in relation to computer science (68R99)
Related Items (25)
An algorithm for handling many relational calculus queries efficiently. ⋮ Efficient dynamic range searching using data replication ⋮ The region approach for computing relative neighbourhood graphs in the \(L_ p\) metric ⋮ On position restricted substring searching in succinct space ⋮ Neighbours on a grid ⋮ On the difficulty of range searching ⋮ A unified algorithm for finding maximum and minimum object enclosing rectangles and cuboids ⋮ Efficient data structures for adaptive remeshing with the FEM ⋮ General methods for adding range restrictions to decomposable searching problems ⋮ On the number of range queries in k-space ⋮ Lower bounds for the addition-subtraction operations in orthogonal range queries and related problems ⋮ Improved data structures for the orthogonal range successor problem ⋮ A robust map matching method by considering memorized multiple matching candidates ⋮ Dynamic orthogonal range queries in OLAP. ⋮ An almost naive algorithm for finding relative neighbourhood graphs in $L_p$ metrics ⋮ Polygonal intersection searching ⋮ Computing the relative neighborhood graph in the \(L_ 1\) and L//infinity metrics ⋮ Information storage and search complexity theory ⋮ On the difficulty of range searching. ⋮ A deterministic skip list for \(k\)-dimensional range search ⋮ On the minimum total length of interval systems expressing all intervals, and range-restricted queries ⋮ An application of $m$-ary trees to the design of data structures for geometric searching problems ⋮ The relative neighborhood graph for mixed feature variables ⋮ The new \(k\)-windows algorithm for improving the \(k\)-means clustering algorithm ⋮ Selection by rank inK-dimensional binary search trees
This page was built for publication: Efficient worst-case data structures for range searching
