Stack Overflow
Stack Overflow

Questions tagged [r-tree]

R-Tree is a popular index structure for spatial data, stored as Minimum Bounding Rectangles (MBRs).

R-Trees were invented by Antonin Guttman in his 1984 seminal paper R-trees: a dynamic index structure for spatial searching. The extended usability of this data structured is presented in the survey R-trees Have Grown Everywhere and popular implementations include the boost::geometry::index library.

263 questions
7
votes
2 answers

RTree: Count points in the neighbourhoods within each point of another set of points

Why is this not returning a count of number of points in each neighbourhoods (bounding box)? import geopandas as gpd def radius(points_neighbour, points_center, new_field_name, r): """ :param points_neighbour: :param points_center: …
ZHU
  • 904
  • 1
  • 11
  • 25
6
votes
1 answer

R*-Tree C Implementation?

Possible Duplicate: C++ R - tree implementation wanted I've been hunting just about all evening... Anyone know of a R*-Tree implementation that builds on a modern C compiler? Thanks, Chenz
Crazy Chenz
  • 12,650
  • 12
  • 50
  • 62
6
votes
1 answer

Is pickling an Rtree spatial index possible?

Pickling Rtree does not appear straightforward as it is a ctypes wrapper. This comment on SO seconds that assumption. But, in a (much) older @sgillies post (the author of this lib), in the comments section, he suggests that it is indeed doable. Yet,…
kuanb
  • 1,618
  • 2
  • 20
  • 42
6
votes
2 answers

Find closest line to each point on big dataset, possibly using shapely and rtree

I have a simplified map of a city that has streets in it as linestrings and addresses as points. I need to find closest path from each point to any street line. I have a working script that does this, but it runs in polynomial time as it has nested…
StefanK
  • 2,030
  • 1
  • 21
  • 26
6
votes
2 answers

R Tree 50,000 foot overview?

I'm working on a school project that involves taking a lat/long point and finding the top five closest points in a known list of places. The list is to be stored in memory, with the caveat that we must choose an "appropriate data structure" -- that…
roufamatic
  • 18,187
  • 7
  • 57
  • 86
6
votes
2 answers

What is fanout in R-Tree?

I have a doubt about R-Tree data structure. What is fan-out in R-Tree. Is it a Maximum number of entries? How can we determine the minimum and maximum number of entries in R-Tree? Let say if i have 10000 points and my page size i 8kb. Thanks
user3030823
  • 107
  • 1
  • 1
  • 6
6
votes
1 answer

Rtrees - basics of the algorithm

I am trying to understand the basics of RTree algorithm and I am trying to figure out how it performs the search of e.g. all retaurants within 1 km. We would have all objects stores in rectangles in our database, we would then (prbably) build a…
Bober02
  • 15,034
  • 31
  • 92
  • 178
5
votes
2 answers

Which spatial data structure (algorithm) is best for (searching in) a set of regions (spacial data)?

I have a set of regions (geo-fences) which are polygons. This set of data is fixed; so there is no need for insertion and deletion of data. Which data structure can be used for searching for regions that a query point (longitude, latitude) is in…
Kaveh Shahbazian
  • 13,088
  • 13
  • 80
  • 139
5
votes
1 answer

Storing or accessing objects in boost r-tree

I am using Boost's r-tree implementation in my code. I have a list of objects with coordinates (say cities on a map, if it matters), which I wish to index in the r-tree, to perform fast NN search, etc. I have followed their iterative query example,…
liorr
  • 764
  • 5
  • 21
5
votes
2 answers

What kind of queries in Core Data can profit from R-Tree index on attributes?

After reading this article https://www.sqlite.org/rtree.html about the R*Tree in SQLite, i am currently experimenting with a 2-Dim R-Tree in a Core Data model. Particularly i expected (maybe somewhat naively) some kind of select statement on the…
user5924595
5
votes
4 answers

Android SQLite R-Tree - How to install module?

http://www.sqlite.org/rtree.html says that the r*tree is "included as part of the amalgamation but is disabled by default" and to enable it "simply compile with the SQLITE_ENABLE_RTREE C-preprocessor macro defined" Well I want to use R-trees in my…
James Coote
  • 1,975
  • 19
  • 29
5
votes
1 answer

What clustering algorithm is suitable for 2d rectangles without knowing the number of clusters ahead of time?

The problem I have is that there are rectangles within rectangles. Think of a map, except with the following traits with the key point being: rectangles with similar density often share similar dimensions and similar position on the x axis with…
javastudent
  • 359
  • 1
  • 4
  • 12
5
votes
2 answers

IComparer issue

I have a weird issue and I don't have a clue to track the reason. I will try to descript my issue clearly. I have a RTree class, in this class, I want to compare two rectanlge (here I called envelope, it contains minX, minY, maxX, maxY), so we have…
Howard
  • 3,638
  • 4
  • 32
  • 39
5
votes
3 answers

Persistent (Disk Based) R-Tree (or R* Tree)

How can R* Tree be implemented as a persistent (disk based) one? What is the architecture of the file for saving the R* Tree index or for saving leaf values? Notes: In addition how insert, update and delete operations can be performed in such a…
Kaveh Shahbazian
  • 13,088
  • 13
  • 80
  • 139
5
votes
1 answer

choice of parameters for R* Tree using SpatialIndex library

I am using the spatialindex library from http://libspatialindex.github.com/ I am creating an R* tree in the main memory: size_t capacity = 10; bool bWriteThrough = false; fileInMem = StorageManager ::createNewRandomEvictionsBuffer(*memStorage,…
arthur
  • 1,034
  • 2
  • 17
  • 31
1
2
3
…
17 18