R-tree
Tree-based data structure, used to index spatial information
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 Antonin Guttman in 1984 and has found significant use in both theoretical and applied contexts.
Nº Q1198051 ★★
Uncommon · Knowledge
R-tree
Tree-based data structure, used to index spatial information
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 Antonin Guttman in 1984 and has found significant use in both theoretical and applied contexts.
Last price
—
Floor price
—
7-day median
—
30-day sales
0
30-day range
—
In circulation
0
Price history
median
low – high
sales
No sales in this period
Show table
| Date | median | Low | High | sales |
|---|
Sales history
- Last sale
- —
- 30-day average
- —
- 30-day low
- —
- 30-day high
- —
- Sales 7d
- 0
- Sales 30d
- 0
No sales yet.
Anonymous sales: no buyer or seller shown. Figures count player-to-player sales only.
From Wikipedia
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 Antonin Guttman in 1984 and has found significant use in both theoretical and applied contexts. A common real-world usage for an R-tree might be to store spatial objects such as restaurant locations or the polygons that typical maps are made of: streets, buildings, outlines of lakes, coastlines, etc. and then find answers quickly to queries such as "Find all museums within 2 km of my current location", "retrieve all road segments within 2 km of my location" (to display them in a navigation system) or "find the nearest gas station" (although not taking roads into account). The R-tree can also accelerate nearest neighbor search for various distance metrics, including great-circle distance.
Text: Wikipédia, CC BY-SA 4.0. · Image: Skinkie, w:en:Radim Baca (Public domain) ·
Related cards
K-d tree
Multidimensional search tree for points in k dimensional space
Nº Q309949 ★★
Segment tree
Tree data structure used in computer science
Nº Q2377385 ★
B-tree
A self-balancing, tree-based data structure, that allows read/write access in logarithmic time
Nº Q677051 ★★★
Tree structure
Way of representing the hierarchical nature of a structure in a graphical form
Nº Q2067937 ★★
Quadtree
Tree data structure in which each internal node has exactly four children
Nº Q934791 ★★
Round-robin scheduling
Algorithm employed by process and network schedulers in computing
Nº Q1196582 ★★