Expected and worst-case storage requirements for quadtrees

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.

[1]  K. Steiglitz,et al.  Operations on ImagesUsingQuadTrees , 1979 .

[2]  Charles R. Dyer,et al.  The space efficiency of quadtrees , 1982, Comput. Graph. Image Process..

[3]  B. Mandelbrot,et al.  Fractals: Form, Chance and Dimension , 1978 .

[4]  Ming Li,et al.  Normalized quadtrees with respect to translations , 1982, Comput. Graph. Image Process..

[5]  Azriel Rosenfeld,et al.  Digital Picture Processing , 1976 .

[6]  Hanan Samet,et al.  An Algorithm for Converting Rasters to Quadtrees , 1981, IEEE Transactions on Pattern Analysis and Machine Intelligence.