r-trees

R-trees are a type of data structure used for indexing spatial data in order to perform efficient spatial searches. The structure is organized in a tree-like format where each node represents a bounding box that contains the spatial objects within its sub-tree. R-trees are commonly used in databases and GIS applications to quickly retrieve data based on their spatial location.

Explore

Requires login.