Squarish k-d Trees
From MaRDI portal
Publication:2706131
DOI10.1137/S0097539799358926zbMath0977.68024MaRDI QIDQ2706131
Jean Jabbour, Zamora-Cura, Carlos, Luc P. Devroye
Publication date: 19 March 2001
Published in: SIAM Journal on Computing (Search for Journal in Brave)
data structuresprobabilistic analysis of algorithmsexpected timerange searchpartial match query\(k\)-\(d\) trees
Analysis of algorithms and problem complexity (68Q25) Combinatorial probability (60C05) Data structures (68P05)
Related Items (9)
Expected time analysis for Delaunay point location ⋮ On the cost of fixed partial match queries in \(K\)-d trees ⋮ On the expected cost of partial match queries in random quad-\(K\)-d trees ⋮ Median and hybrid median \(K\)-dimensional trees ⋮ Quad-\(k\mathrm d\) trees: a general framework for \(k\mathrm d\) trees and quad trees ⋮ SKIP QUADTREES: DYNAMIC DATA STRUCTURES FOR MULTIDIMENSIONAL POINT SETS ⋮ Weighted height of random trees ⋮ A limit field for orthogonal range searches in two-dimensional random point search trees ⋮ Selection by rank inK-dimensional binary search trees
This page was built for publication: Squarish k-d Trees
