The Community for Technology Leaders
Green Image
Issue No. 02 - February (1979 vol. 1)
ISSN: 0162-8828
pp: 145-153
Gregory M. Hunter , MEMBER, IEEE, Decisions and Designs, Inc., McLean, VA 22101.
Kenneth Steiglitz , MEMBER, IEEE, Department of Electrical Engineering and Computer Science, Princeton University, Princeton, NJ 08540.
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.
Tree graphs, Encoding, Compaction, Design automation, Computer graphics, Layout, Pattern recognition, Image processing, Process planning, Floors

G. M. Hunter and K. Steiglitz, "Operations on Images Using Quad Trees," in IEEE Transactions on Pattern Analysis & Machine Intelligence, vol. 1, no. 2, pp. 145-153, .
92 ms
(Ver 3.3 (11022016))