Orthogonal Range Searching in Moderate Dimensions: k-d Trees and Range Trees Strike Back
From MaRDI portal
Recommendations
- Orthogonal range searching in moderate dimensions: k-d trees and range trees strike back
- The \(n\)-dimensional \(k\)-vector and its application to orthogonal range searching
- Compact and succinct data structures for multidimensional orthogonal range searching
- Orthogonal range searching in linear and almost-linear space
- Orthogonal Range Searching in Linear and Almost-Linear Space
- On the average performance of orthogonal range search in multidimensional data structures
- scientific article; zbMATH DE number 2086648
- Algorithms for graphs of bounded treewidth via orthogonal range searching
- Efficient top-k queries for orthogonal ranges
- Faster Linear-space Orthogonal Range Searching in Arbitrary Dimensions
Cited in
(7)- The \(n\)-dimensional \(k\)-vector and its application to orthogonal range searching
- Orthogonal range searching in moderate dimensions: k-d trees and range trees strike back
- On k-d Range Search with Patricia Tries
- scientific article; zbMATH DE number 2086643 (Why is no real title available?)
- Rectangle stabbing and orthogonal range reporting lower bounds in moderate dimensions
- \#SAT-algorithms for classes of threshold circuits based on probabilistic rank
- (Multivariate) k-SUM as barrier to succinct computation
This page was built for publication: Orthogonal Range Searching in Moderate Dimensions: k-d Trees and Range Trees Strike Back
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4580101)
