|
| This Article | ||
| ||
| Share | ||
| Bibliographic References | ||
| Add to: | ||
| | ||
| Search | ||
| ||
| ASCII Text | x | ||
| Gregory M. Hunter, Kenneth Steiglitz, "Operations on Images Using Quad Trees," IEEE Transactions on Pattern Analysis and Machine Intelligence, vol. 1, no. 2, pp. 145-153, February, 1979. | |||
| BibTex | x | ||
| @article{ 10.1109/TPAMI.1979.4766900, author = {Gregory M. Hunter and Kenneth Steiglitz}, title = {Operations on Images Using Quad Trees}, journal ={IEEE Transactions on Pattern Analysis and Machine Intelligence}, volume = {1}, number = {2}, issn = {0162-8828}, year = {1979}, pages = {145-153}, doi = {http://doi.ieeecomputersociety.org/10.1109/TPAMI.1979.4766900}, publisher = {IEEE Computer Society}, address = {Los Alamitos, CA, USA}, } | |||
| RefWorks Procite/RefMan/Endnote | x | ||
| TY - JOUR JO - IEEE Transactions on Pattern Analysis and Machine Intelligence TI - Operations on Images Using Quad Trees IS - 2 SN - 0162-8828 SP145 EP153 EPD - 145-153 A1 - Gregory M. Hunter, A1 - Kenneth Steiglitz, PY - 1979 VL - 1 JA - IEEE Transactions on Pattern Analysis and Machine Intelligence ER - | |||
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.
Citation:
Gregory M. Hunter, Kenneth Steiglitz, "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.

