An Analysis of Randomd-Dimensional Quad Trees
Work
Year: 1990
Type: article
Abstract: It is shown that the depth of the last node inserted in a random quad tree constructed from independent uniform $[0,1]^d $ random vectors is in probability asymptotic to $({2 / d}) \log n$, where log ... more
Source: SIAM Journal on Computing
Authors Luc Devroye, Louise Laforest
Institutions McGill University, Université du Québec à Montréal
Cites: 26
Cited by: 25
Related to: 10
FWCI: 1.513
Citation percentile (by year/subfield): 85.88
Subfield: Signal Processing
Field: Computer Science
Domain: Physical Sciences
Open Access status: green