R^*-tree

(data structure)

Definition: A spatial access method which splits space in hierarchically nested, possibly overlapping, boxes. The tree is height-balanced. It is similar to the R-tree, but reinserts entries upon overflow, rather than splitting.

Note: After [GG98].

Author: PEB

Implementation

In Marios Hadjieleftheriou's Spatial Index Library (C++)

Go to the Dictionary of Algorithms and Data Structures home page.

If you have suggestions, corrections, or comments, please get in touch with Paul Black.

Entry modified 22 April 2019.
HTML page formatted Mon Apr 22 12:17:39 2019.

Cite this as:
Paul E. Black, "R^*-tree", in Dictionary of Algorithms and Data Structures [online], Paul E. Black, ed. 22 April 2019. (accessed TODAY) Available from: https://www.nist.gov/dads/HTML/rstartree.html

R*-tree

Implementation

R^*-tree