- Graph families
- >
- Trees (graph theory)
- >
- Trees (data structures)
- >
- R-tree

- Graphs
- >
- Application-specific graphs
- >
- Trees (data structures)
- >
- R-tree

- Trees (topology)
- >
- Trees (graph theory)
- >
- Trees (data structures)
- >
- R-tree

R+ tree

An R+ tree is a method for looking up data using a location, often (x, y) coordinates, and often for locations on the surface of the earth. Searching on one number is a solved problem; searching on tw

Hilbert R-tree

Hilbert R-tree, an R-tree variant, is an index for multidimensional objects such as lines, regions, 3-D objects, or high-dimensional feature-based parametric objects. It can be thought of as an extens

X-tree

In computer science tree data structures, an X-tree (for eXtended node tree) is an index tree structure based on the R-tree used for storing data in many dimensions. It appeared in 1996, and differs f

R*-tree

In data processing R*-trees are a variant of R-trees used for indexing spatial information. R*-trees have slightly higher construction cost than standard R-trees, as the data may need to be reinserted

Priority R-tree

The Priority R-tree is a worst-case asymptotically optimal alternative to the spatial tree R-tree. It was first proposed by Arge, De Berg, Haverkort and Yi, K. in an article from 2004. The prioritized

R-tree

R-trees are tree data structures used for spatial access methods, i.e., for indexing multi-dimensional information such as geographical coordinates, rectangles or polygons. The R-tree was proposed by

© 2023 Useful Links.