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

How can I use the index-structures in ELKI?

These are quotes form http://elki.dbs.ifi.lmu.de/ : "Essentially, we bind the abstract distance query to a database, and then get a nearest neighbor search for this distance. At this point, ELKI will automatically choose the most appropriate kNN…
3
votes
3 answers

Difference between quadratic split and linear split

I am trying to understand how r-tree works, and saw that there are two types of splits: quadratic and linear. What are actually the differences between linear and quadratic? and in which case one would be preferred over the other?
Dejell
  • 13,947
  • 40
  • 146
  • 229
3
votes
2 answers

Data structure(s) for storing nested boxes?

I have a list of rectangles stored as points. Currently, the data looks something like this: boxes = [{'p1': (0,0), 'p2': (100,20)}, {'p1': (5,5), 'p2': (15,15)}, {'p1': (20,5), 'p2': (30,15)}, {'p1': (35,5), 'p2':…
3
votes
3 answers

R-Trees : should I reinvent the wheel?

I'm trying to understand how to implement an R-Tree which will be used for "selecting" a set of geometrical objects contained in a bounding rectangle. I checked out the article on Wikipedia, which shows an example of data layout as a B-Tree. I could…
Jean-Marie Comets
  • 706
  • 2
  • 7
  • 21
3
votes
1 answer

Insert new leaves in R* Tree

What is the steps of the insertion algorithm of R* Tree? Note: I want to be able to construct the tree by insertion. IT ALWAYS GIVES ME CRAP TREES with maximum overlap and maximum area cover not matter what condition I choose for selecting the best…
Kaveh Shahbazian
  • 13,088
  • 13
  • 80
  • 139
3
votes
1 answer

BulkLoading the R* tree with spatialindex library

After successfully building the R* tree with spatial library inserting records one-by-one 2.5 million of times, I was trying to create the R* tree with bulkloading. I implemented the DBStream class to iteratively give the data to the BulkLoader.…
arthur
  • 1,034
  • 2
  • 17
  • 31
2
votes
2 answers

How to detect if a 2-D shape contains another shape with R-tree?

I have a program where a 2D shape is represented by an R-trees. I want to be able to efficiently detect whether a shape is completely contained within another shape. Is this possible with R-tree?
settinghead
  • 95
  • 1
  • 6
2
votes
1 answer

Build rtree with boost::geometry results in errors

I wrote this small program, following the boost documentation, but I get pages of errors when building it. #include #include #include #include…
nowox
  • 25,978
  • 39
  • 143
  • 293
2
votes
1 answer

Is it possible to use Android Room Database to create an R*Tree table?

I would like to continue using Room, but I see no way to create an Entity that uses rtree. There is @FTS3 and @FTS4 annotations but nothing for RTree that I see. Is it possible to create an Entity using R-Tree? I was attempting to do a migration…
user1230593
  • 243
  • 1
  • 3
  • 9
2
votes
2 answers

How to traverse Rtree 0.6.0 in Python

Does anyone know how to traverse the whole tree in this Python Rtree library? I've checked all its methods but failed to find a interface for this. Any help would be appreciated.
Brian Sun
  • 21
  • 1
2
votes
0 answers

OSError when executing PyInstaller .exe file - "could not find or load spatialindex_c-64.dll"

I'm trying to make an executable file using pyinstaller. When running the exe from the command line I get the error "could not find spatialindex_c-64.dll". Things I have tried so far: Uninstall and reinstall rtree Create fresh environment, only…
Snibbug
  • 21
  • 2
2
votes
3 answers

Surface mesh triangles: query space within

I have a surface mesh of triangles. Assume, the surface mesh is closed. I intend to do a spatial query to figure out whether a space is within my surface mesh or not. Space unit can be represented by a bounding box, a voxel or any other spatial…
Megidd
  • 7,089
  • 6
  • 65
  • 142
2
votes
2 answers

Spatial index in Berkeley DB

Does Berkeley DB have a spatial index such as R-tree?
propheci
  • 97
  • 1
  • 7
2
votes
2 answers

R-tree - Remove algorithm using reinsertion

I am trying to implement an R-tree in scala following the guidelines from the original paper about the R-tree structure. In the deletion algorithm section is stated: Reinsert all entries of nodes in set Q. Entries from eliminated leaf nodes are…
JimS
  • 349
  • 1
  • 4
  • 19
2
votes
1 answer

how to find nearest point within querybox(query area) using rtree, python

I m new to python, I m using import rtree library. I m indexin the 2 d dimensional points data into rtree and specifying query box(rectangle). I should get the points which lie inside the query box. But I m getting the nearest point which is out of…