Abstract
Region representation as a quadtree data structure is a rich field in computer science with many different approaches. Forests of quadtrees offer space savings over regular quadtrees by concentrating the vital information [4, 5, 6]. They scavenge unused and unneeded space (i.e., node containing no information). This paper investigates several properties of forests of quadtrees which can be used to design manipulation algorithms for forest-quadtree data structure. In addition, the paper discusses the space saving and shows how the basic operations that can be performed on a quadtree can also be done on the more space efficient representation (a forest of quadtrees).
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
C. R. Dyer, A. Rosenfeld and H. Samet,Region representation: Boundary codes from quadtrees, Comm. ACM 23, 3 (March 1980), 171–179.
G. M. Hunter and K. Steiglitz,Operations on images using quadtrees, IEEE Trans. On Pattern Analysis and Intell. 1, 2 (April 1979), 145–153.
G. M. Hunter and K. Steiglitz,Linear transformations of pictures represented by quadtrees, Computer, Graphics and Image Processing 10, 3 (July 1979), 289–296.
L. Jones and S. S. Iyengar,Space and time efficient virtual quadtrees, Technical Report #82-D24, Louisiana State University, Baton Rouge, LA 70803, (Nov, 1982).
L. Jones and S. S. Iyengar,Representation of a region as a forest of quadtrees, Proc. IEEE-PRIP 81 Conference, Dallas, TX, IEEE Publ. 81 Ch1595-8, (1981), 57–59.
L. Jones and S. S. Iyengar,Virtual quadtrees, Proc. IEEE-CVIP 83 Conference, Virginia, IEEE publications (1983), 101–105.
E. Kawaguchi and T. Endo,On a method of binary-picture representation and its application to data compression, IEEE Trans. On Pattern Analysis and Machine Intell. 2, 1 (Jan. 1980), 27–35.
A. Klinger,Patterns and search statistics, optimizing methods in statistics, J. D. Rustagi, (Ed.), Academic Press, New York (1971).
A. Klinger and M. L. Rhodes,Organization and access of image data by areas, IEEE Trans. On Pattern Analysis and Machine Intell. 1, 11 (Jan. 1979), 50–60.
H. Samet,An algorithm for converting rasters to quadtrees, IEEE Trans. On Pattern Analysis and Machine Intell. 3, 1 (Jan. 1981).
H. Samet,Connected component labelling using quadtrees, JACM 28, 3 (July 1981), 487–501.
H. Samet,Region representation: Quadtrees from boundary codes, Comm. ACM 23, 3 (March 1980), 163–170.
S. Klinger and C. R. Dyer,Experiments on picture representation using regular decomposition, Computer Graphics and Image Processing, No. 5 (March 1976), 68–105.
Irene Gargantini,An effective way to represent quadtrees, Comm. of ACM, 25, 12 (Dec. 1982), 905–910.
V. Raman, S. S. Iyengar and S. K. Kandu,An optimal quadtree structure for pictorial data representation using top and bottom compaction technique; to appear in the Proceedings of IEEE-SMC Conference, Bombay, India (Dec. 1983).
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Raman, V., Iyengar, S.S. Properties and applications of forests of quadtrees for pictorial data representation. BIT 23, 472–486 (1983). https://doi.org/10.1007/BF01933621
Received:
Revised:
Issue Date:
DOI: https://doi.org/10.1007/BF01933621