quad tree


Also found in: Acronyms.

quad tree

A tree structure used to search a database. There are always four branches attached to a branch point (node). The search continually divides the available records by four until the desired record is found. See splay tree.
Copyright © 1981-2019 by The Computer Language Company Inc. All Rights reserved. THIS DEFINITION IS FOR PERSONAL USE ONLY. All other reproduction is strictly prohibited without permission from the publisher.
Mentioned in ?
References in periodicals archive ?
Figure 4 depicts the quad tree created using the bounding box of the shape shown in Figure 3.
In DSC, the spatial domain is partitioned by quad tree structure.
The main operations applied on quad trees are reading and modifying an image quad tree, comparing two quad trees and determine the Q-similarity distance.
The quad tree in Figure 3 consists of sequences that each sequence contains two "a," one "b," one "c," and one "d" The sum of sequences is [C.sup.2.sub.5] * [C.sup.1.sub.3] * [C.sup.1.sub.2] * [C.sup.1.sub.1] = 60.
Ruschendorf, On the internal pathlength of d-dimensional quad trees. Random Structures Algorithms 15, 1999, no.