R-tree
R-tree noun: 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.
Noun
R-tree (plural R-trees)
- 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.
Forms of R-tree
| plural | R-trees |
|---|
Origin of R-tree
The R stands for rectangle.
Questions about R-tree
- What does R-tree mean?
- R-tree means 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.
- What part of speech is R-tree?
- R-tree is a noun.
- What is the plural of R-tree?
- The plural of R-tree is R-trees.
Words near R-tree in the dictionary
Source and license
Adapted from Wiktionary: R-tree (page history and authors). Text available under the Creative Commons Attribution-ShareAlike 4.0 license. Word.ws reformatted the entry and added links. Wiktionary data of 2026-09-02.
Last updated:
Cite this entry: “R-tree.” Word.ws, https://word.ws/r-tree. Based on Wiktionary, CC BY-SA 4.0.
