Algorithm for converting a forest of quadtrees to a binary array

An algorithm for reconstructing a binary array of size NsxN from its forest of quadtree representation is presented. The algorithm traverses each tree of the forest in preorder and maps each `black? node into the spatial domain. The time complexity in mapping is O(log N × Bn + Bp), where Bn is the number of black nodes in the forest and Bp is the number of black pixels in the N × N array. The algorithm has been implemented on an Apple II.

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

[2]  Hanan Samet,et al.  Algorithms for the conversion of quadtrees to rasters , 1984, Comput. Vis. Graph. Image Process..

[3]  Irene Gargantini,et al.  An effective way to represent quadtrees , 1982, CACM.

[4]  Charles R. Dyer,et al.  Experiments on Picture Representation Using Regular Decomposition , 1976 .

[5]  S. Sitharama Iyengar,et al.  Space and Time Efficient Virtual Quadtress , 1984, IEEE Transactions on Pattern Analysis and Machine Intelligence.

[6]  S. Sitharama Iyengar,et al.  Properties and applications of forests of quadtrees for pictorial data representation , 1983, BIT.

[7]  Hanan Samet,et al.  The Quadtree and Related Hierarchical Data Structures , 1984, CSUR.