(n) :
(computing theory) A kind of tree data structure used to group objects by nearness of location, representing them by their minimum bounding rectangles in the next higher level of the tree.
(n) :
(computing theory) A kind of tree data structure used to group objects by nearness of location, representing them by their minimum bounding rectangles in the next higher level of the tree.