title: Operations on images using quad trees.
abstract: 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.
authors.affiliation: MEMBER, IEEE, Decisions and Designs, Inc., McLean, VA 22101.
authors.forename: G M
authors.initials: GM
authors.lastname: Hunter
authors.forename: K
authors.initials: K
authors.lastname: Steiglitz