Expected and worst-case storage requirements for quadtrees.
F. Warren BurtonVassiliki J. KolliasJohn G. KolliasPublished in: Pattern Recognit. Lett. (1985)
Keyphrases
- storage requirements
- worst case
- computational complexity
- upper bound
- computational cost
- average case
- quadtree
- high computational complexity
- memory requirements
- lower bound
- greedy algorithm
- error bounds
- significantly reduced
- running times
- frame rate
- approximation algorithms
- data structure
- connected components
- np hard
- worst case bounds
- r tree
- index structure
- multi class
- feature vectors
- learning algorithm
- worst case analysis