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
0
votes
2 answers

Data structure for spatial queries (kNN) on dynamic data

For spatial queries like nearest neighbor search, in theory, KD tree or Voronoi or R tree(or one of its variants) work. But what is the preferred data structure/algo for dynamic data?
mithya
  • 363
  • 1
  • 10
0
votes
1 answer

How to port simple spatial index using SQLite R-Trees to Postgres?

I have implemented a simple spatial indexing schema based on bounding boxes by following the SQLite R*Tree tutorial, which has given me the following schema: CREATE VIRTUAL TABLE events_region USING rtree( id, -- primary key …
nedned
  • 3,552
  • 8
  • 38
  • 41
0
votes
1 answer

KD-Tree on secondary memory?

I know some of the range searching data structure, for example kd-tree, Range tree and quad-tree. But all the implementation is in memory, how can I implementation them on secondary memory with high performance I/O efficiency? Here is the…
Zhao Yuhao
  • 11
  • 1
0
votes
2 answers

Index for fast point-(> 100.000.000)-in-polygon-(> 10.000)-test

Problem I'm working with openstreetmap-data and want to test for point-features in which polygon they lie. In total there are 10.000s of polygons and 100.000.000 of points. I can hold all this data in memory. The polygons usually have 1000s of…
user2033412
  • 1,950
  • 2
  • 27
  • 47
0
votes
1 answer

OSError: dlopen(libspatialindex_c.dylib, 6): image not found

MacOS Python Rtree installation OSError: dlopen(libspatialindex_c.dylib, 6): image not found. I followed the instruction on http://toblerity.org/rtree/install.html#nix as below: First, download and install version 1.7.0 of the libspatialindex…
user3610141
  • 305
  • 1
  • 4
  • 14
0
votes
1 answer

Splitting algorithm in R--Tree

Is splitting algorithm affecting our query answer? There is several splitting algorithms for R-tree such as Quadratic, Linear, Greene's, Ang and Tan etc. Besides search time, does this algorithms affect our query answer?
user3030823
  • 107
  • 1
  • 1
  • 6
0
votes
1 answer

R+-Tree explanation required

1) I came across a picture (see below) that shows an example of R+-Tree with some data in it. How it is possible that there is a space between the nodes "A" and "B"? As i understood, any new nodes are created by splitting procedure, so they are…
pavelkolodin
  • 2,859
  • 3
  • 31
  • 74
0
votes
1 answer

Leaflet — point in which polygon? Rtree?

Does leaflet provide a method for determining which, if any, rendered point is within a polygon? Not by iterating over a bunch of shapes and checking bounds, but by using an rtree index, perhaps?
Lee Goddard
  • 10,680
  • 4
  • 46
  • 63
0
votes
1 answer

Create a Rtree using a Map Reduce algorithm?

In the current scenario, I Have a Rtree instance in which I add millions of records, which takes around 1 hr to create. I was wondering if I can use multiple mappers to create multiple RTrees & then merge them in the reducer to create the final…
Pankaj Khattar
  • 111
  • 1
  • 10
0
votes
3 answers

R-tree implementation in matlab

please, any one tell me how we can implement the R-tree structure in matlab to speed the image retrieval system , I would like to inform you that my database space a feature vector of Color Histogram (Multidimensional ) and also I I have a distance…
zenab
0
votes
1 answer

sqlite not using index on android

I am executing the following query on an sqlite database on desktop and android: SELECT kdtree_nonendpt.verid, minlat, minlon, data FROM kdtree_nonendpt, kdtree_nonendpt_data WHERE kdtree_nonendpt.verid IN (SELECT kdtree_nonendpt.verid …
iggy
  • 1,613
  • 1
  • 18
  • 35
0
votes
1 answer

JSI RTree implementation "contains" method giving incorrect results?

I am trying to use the JSI RTree implementation https://github.com/aled/jsi to index geo locations for my application. I load it up with about 7M entries and then I query it using the contains method with a bounding box around the states of…
mattx
  • 245
  • 1
  • 10
0
votes
1 answer

How do I use an rtree to organise HTML elements to reduce the number of times I have to run an overlap check?

I have a number of elements that I need to add to a page using javascript with data pulled from the server with their position information. I want to arrange them so that there is no overlap. For example, element 5 would be moved to where the thin…
Cameron
  • 1,011
  • 1
  • 10
  • 20
0
votes
1 answer

r* tree reinsert

how does the reinsert works? When i select entries to reinsert, i run again insert algorithm? So reinserted entries can be anywhere in the tree? Or these entries can be only in siblings leafs, in fact, only in the leafs, which have same parent as…
0
votes
1 answer

R-tree in opencv2.1.0

I am using opencv2.1.0 and I want to use r-tree structures via opencv. My idea is to find near by line segments for a given line segment (all are in 2d) using r-tree. I really do not know how to use this r-tree functions and i have end point…
niro
  • 947
  • 3
  • 13
  • 30