| authors |
Hunter, Gregory M. and Steiglitz, Kenneth |
| year |
1979 |
| title |
Operations on Images Using Quad Trees |
| source |
IEEE Transactions on Pattern Analysis and Machine Intelligence. April, 1979. vol. PAMI-1: pp. 145-153 : ill. includes bibliography |
| summary |
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 |
| keywords |
GIS, mapping, CAD, layout, pattern recognition, polyhedra, quadtree, planning, image processing, computer graphics |
| series |
CADline |
| references |
Content-type: text/plain
|
| last changed |
2003/06/02 13:58 |
|
