ON MULTI-LEVEL k-RANGES FOR RANGE SEARCH

DOI10.1142/S0218195905001853MaRDI QIDQ3373054zbMATH OpenOpenAlexFDO

Authors S. Falconer, Bradford G. Nickerson

Publication date 13 March 2006

Published in International Journal of Computational Geometry & Applications (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1142/s0218195905001853

zbMATH Keywords

multidimensional orthogonal range searchspace and time complexity

Mathematics Subject Classification ID

Searching and sorting (68P10)

Recommendations

• A deterministic skip list for \(k\)-dimensional range search
• scientific article; zbMATH DE number 3907783
• scientific article; zbMATH DE number 2086648
• Analysis of range search for random \(k-d\) trees
• On the average performance of orthogonal range search in multidimensional data structures

Cited in

(4)

• On the minimum total length of interval systems expressing all intervals, and range-restricted queries
• A deterministic skip list for \(k\)-dimensional range search
• Multilevel polynomial partitions and simplified range searching
• On k-d Range Search with Patricia Tries

This page was built for publication: ON MULTI-LEVEL k-RANGES FOR RANGE SEARCH

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