Sciweavers

Share
SIAMCOMP
2000

Squarish k-d Trees

9 years 5 months ago
Squarish k-d Trees
We modify the k-d tree on [0, 1]d by always cutting the longest edge instead of rotating through the coordinates. This modification makes the expected time behavior of lowerdimensional partial match queries behave as perfectly balanced complete k-d trees on n nodes. This is in contrast to a result of Flajolet and Puech [J. Assoc. Comput. Mach., 33 (1986), pp. 371
Luc Devroye, Jean Jabbour, Carlos Zamora-Cura
Added 19 Dec 2010
Updated 19 Dec 2010
Type Journal
Year 2000
Where SIAMCOMP
Authors Luc Devroye, Jean Jabbour, Carlos Zamora-Cura
Comments (0)
books