Analysis of range search for random \(k-d\) trees
From MaRDI portal
Publication:5925823
DOI10.1007/s002360000044zbMath0970.68046OpenAlexW2065795466MaRDI QIDQ5925823
Luc P. Devroye, Zamora-Cura, Carlos, Chanzy, Philippe
Publication date: 20 February 2001
Published in: Acta Informatica (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s002360000044
Related Items
Expected time analysis for Delaunay point location ⋮ On the cost of fixed partial match queries in \(K\)-d trees ⋮ Quad-\(k\mathrm d\) trees: a general framework for \(k\mathrm d\) trees and quad trees ⋮ A limit field for orthogonal range searches in two-dimensional random point search trees ⋮ Selection by rank inK-dimensional binary search trees