This Article 
 Bibliographic References 
 Add to: 
Operations on Images Using Quad Trees
February 1979 (vol. 1 no. 2)
pp. 145-153
A quad tree for representing a picture is a tree in which successively deeper levels represent successively finer subdivisions of picture area. An algorithm is given for superposing N quad trees in time proportional to the total number of nodes in the trees. Warnock-type algorithms are then presented for building the quad tree for the picture of the boundary of a polygon, and for coloring the interior of such a polygon. These algorithms take O(v + p + q) time, where v is the number of polygon vertices, p is the polygon perimeter, and q is a resolution parameter. When the resolution q is fixed, these algorithms are asymptotically optimal.
Index Terms:
Tree graphs,Encoding,Compaction,Design automation,Computer graphics,Layout,Pattern recognition,Image processing,Process planning,Floors,space planning,Cartography,computer-aided design,encoded raster graphics,layout,pattern recognition,picture compaction,picture processing,pyramid,quad tree,Q-tree,rope,scan-line encoding
"Operations on Images Using Quad Trees," IEEE Transactions on Pattern Analysis and Machine Intelligence, vol. 1, no. 2, pp. 145-153, Feb. 1979, doi:10.1109/TPAMI.1979.4766900
Usage of this product signifies your acceptance of the Terms of Use.