A Probabilistic Analysis of Hierarchical Geometric Data Structures*

Abstract

The size of five hierarchical geometric data structures is investigated analytically using random image models. Upper bounds on the size of the structures, as well as some lower bounds, are derived. The results are useful in predicting the storage required by the structures as well as the performance of algorithms that rely on them.

Extracted Key Phrases

Cite this paper

@inproceedings{Lindenbaum2004APA, title={A Probabilistic Analysis of Hierarchical Geometric Data Structures*}, author={Michael Lindenbaum and Hanan Samet}, year={2004} }