DocumentCode
3377131
Title
A probabilistic analysis of hierarchical geometric data structures
Author
Lindenbaum, Michael ; Samet, Hanan
Author_Institution
Dept. of Electr. Eng., Technion, Haifa, Israel
Volume
ii
fYear
1990
fDate
16-21 Jun 1990
Firstpage
91
Abstract
The size of five hierarchical geometric data structures is investigated analytically using random image models. Upper bounds and some lower bounds on the size of the structures 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
Keywords
data structures; pattern recognition; picture processing; probability; trees (mathematics); algorithms performance; hierarchical geometric data structures; pattern recognition; picture processing; probabilistic analysis; random image models; storage requirements; Automation; Computer science; Data structures; Educational institutions; Image analysis; Performance analysis; Solid modeling; Spatial resolution; Statistical analysis; Upper bound;
fLanguage
English
Publisher
ieee
Conference_Titel
Pattern Recognition, 1990. Proceedings., 10th International Conference on
Conference_Location
Atlantic City, NJ
Print_ISBN
0-8186-2062-5
Type
conf
DOI
10.1109/ICPR.1990.119336
Filename
119336
Link To Document