R-tree

名词noun

1. 1(computer science) 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.