This is the authors' abstract. We don't add key points for this paper.
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.
Answers are grounded in this paper and cite their sources.
No takes yet. Share an insight, caveat, or question.
Hunter et al. (1979) studied this question.
Synapse has enriched 10 related papers. Consider them for comparative context: