R-tree

Noun

Meaning

R-tree (plural R-trees)

(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.

Source: en.wiktionary.org

Related terms

Hilbert R-tree priority R-tree

Close letter words and terms

r-slur r-slurred r-tard R-UHPC r-value r-word