This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
An Algorithm for Converting Rasters to Quadtrees
January 1981 (vol. 3 no. 1)
pp. 93-95
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.
Citation:
Hanan Samet, "An Algorithm for Converting Rasters to Quadtrees," IEEE Transactions on Pattern Analysis and Machine Intelligence, vol. 3, no. 1, pp. 93-95, Jan. 1981, doi:10.1109/TPAMI.1981.4767054
Usage of this product signifies your acceptance of the Terms of Use.