Expected and worst-case storage requirements for quadtrees

Authors:
F.Warren Burton;Vassiliki J Kollias;J.(Yiannis) G Kollias
Affiliations:
Department of Electrical Engineering and Computer Science, Box 104, University of Colorado at Denver, 1100 Fourteenth Street, Denver, Colorado 80122, USA;Athens Faculty of Agriculture, Laboratory of Soils and Agricultural Chemistry, Iera Odos, Votanicos, Athens, Greece;Department of Computer Science, National Technical University of Athens, 9, Heroon Polytechniou Avenue, Zografou, Athens (21), Greece
Venue:
Pattern Recognition Letters
Year:
1985

Citing 2
Cited 1

An Algorithm for Converting Rasters to Quadtrees

IEEE Transactions on Pattern Analysis and Machine Intelligence
Operations on Images Using Quad Trees

IEEE Transactions on Pattern Analysis and Machine Intelligence

A random model for analyzing region quadtrees

Pattern Recognition Letters

Quantified Score

Hi-index	0.10

Visualization

Abstract

The expected and worst-case numbers of nodes required for the quadtree representation of curves or regions are investigated. It is shown that in both cases the numbers are roughly proportional to the number of pixels in the curve or the boundary of the region, but that the worst case-storage requirements are at least 2 @/2 times the size of the expected storage requirements, provided some reasonable assumptions are made.