R-Tree (Spatial Indexing) – R-trees are tree data structures used for spatial access methods, i.e., for indexing multi-dimensional information such as for instance geographic coordinates, rectangles or polygons. The R-tree ended up being proposed by blackdatingforfree.com reddit Antonin Guttman in 1984 and has now discovered use that is significant both theoretical and used contexts. A standard real-world use for an R-tree may be to keep spatial things such as for instance restaurant areas or the polygons that typical maps are constructed of roads, structures, outlines of lakes, coastlines, etc. then find responses quickly to questions such as “Find all museums within 2 kilometer of my current location”, “retrieve all road portions within 2 kilometer of my location” (to show them in a navigation system) or “find the gas station that is nearest” (while not using roadways into consideration).
A CineKat_Filmworks project