Abstract
A hierarchical image representation similar to pyramids <202>, they have nodes that correspond to the cells of a pyramid and each non-terminal node has four children, but unlike a pyramid, a quad tree may be pruned so as to be unbalanced. For example, when all nodes in a subtree have the same gray value, the subtree may be represented by its root without loss of information, so that significant storage savings can be obtained for many images. More significantly, quad trees allow some operations to be performed efficiently by recursive procedures.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Reference
Cohen, P. and Feigenbaum, E. (editors). The Handbook of Artificial Intelligence Vol.3. Kaufmann, 1982.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1984 Springer-Verlag Berlin Heidelberg
About this chapter
Cite this chapter
Bundy, A., Wallen, L. (1984). Quad Trees. In: Bundy, A., Wallen, L. (eds) Catalogue of Artificial Intelligence Tools. Symbolic Computation. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-96868-6_204
Download citation
DOI: https://doi.org/10.1007/978-3-642-96868-6_204
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-13938-6
Online ISBN: 978-3-642-96868-6
eBook Packages: Springer Book Archive