Distribution of black nodes at various levels in a linear quadtree
Pattern Recognition Letters
Average efficiency of data structures for binary image processing
Information Processing Letters
A formula for computing the number of quadtree node fragments created by a shift
Pattern Recognition Letters
The design and analysis of spatial data structures
The design and analysis of spatial data structures
Average-case analysis of algorithms and data structures
Handbook of theoretical computer science (vol. A)
Analytical results on the quadtree decomposition of arbitrary rectangles
Pattern Recognition Letters
Beyond uniformity and independence: analysis of R-trees using the concept of fractal dimension
PODS '94 Proceedings of the thirteenth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
Analytical Results on the Quadtree Storage-Requirements
CAIP '93 Proceedings of the 5th International Conference on Computer Analysis of Images and Patterns
A Model for the Analysis of Neighbor Finding in Pointer-Based Quadtrees
IEEE Transactions on Pattern Analysis and Machine Intelligence
Markov Random Field Texture Models
IEEE Transactions on Pattern Analysis and Machine Intelligence
Expected and worst-case storage requirements for quadtrees
Pattern Recognition Letters
Hi-index | 0.10 |
A new random tree model, suitable for analyzing the storage efficiency of region quadtrees, is introduced. For certain values of parameters this model is proved to he the formal equivalent of an older popular random tree model. A formula that expresses the average number of nodes in a region quadtree obeying this model is also given and proved in two different ways.