Issue No. 01 - January (1981 vol. 3)
Hanan Samet , Department of Computer Science, University of Maryland, College Park, MD 20742.
An algorithm is presented for constructing a quadtree for a binary image given its row-by-row description. The algorithm processes the image one row at a time and merges identically colored sons as soon as possible, so that a minimal size quadtree exists after processing each pixel. This method is spacewise superior to one which reads in an entire array and then attempts to build the quadtree.
H. Samet, "An Algorithm for Converting Rasters to Quadtrees," in IEEE Transactions on Pattern Analysis & Machine Intelligence, vol. 3, no. , pp. 93-95, 1981.