Efficient worst-case data structures for range searching

Cited In (25)

An algorithm for handling many relational calculus queries efficiently.
An application of $m$-ary trees to the design of data structures for geometric searching problems
The new $k$-windows algorithm for improving the $k$-means clustering algorithm
A robust map matching method by considering memorized multiple matching candidates
Efficient data structures for adaptive remeshing with the FEM
Polygonal intersection searching
Information storage and search complexity theory
On the difficulty of range searching
Dynamic orthogonal range queries in OLAP.
The relative neighborhood graph for mixed feature variables
Efficient dynamic range searching using data replication
On the minimum total length of interval systems expressing all intervals, and range-restricted queries
On the number of range queries in k-space
On the difficulty of range searching.
A deterministic skip list for $k$-dimensional range search
General methods for adding range restrictions to decomposable searching problems
Improved data structures for the orthogonal range successor problem
The region approach for computing relative neighbourhood graphs in the $L_ p$ metric
An almost naive algorithm for finding relative neighbourhood graphs in $L_p$ metrics
A unified algorithm for finding maximum and minimum object enclosing rectangles and cuboids
Lower bounds for the addition-subtraction operations in orthogonal range queries and related problems
Neighbours on a grid
Computing the relative neighborhood graph in the $L_ 1$ and L//infinity metrics
On position restricted substring searching in succinct space
Selection by rank in K-dimensional binary search trees

This page was built for publication: Efficient worst-case data structures for range searching

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1134522)