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

C++ spatialindex library: loading/storing main memory RTree from/to disk

I have created a main memory R* index with the help of spatialindex library in the following way (DBStream implements the interface for bulkLoading) // creating a main memory RTree memStorage =…
arthur
  • 1,034
  • 2
  • 17
  • 31
0
votes
1 answer

MySQL Storing different nested sets in same table

I have a table that stores nested sets. It stores different nested sets differentiated by a collectionid (yes i'm mixing terms here, really should be nestedsetid). it looks somewhat like this: id | orgid | leftedge | rightedge | level |…
Jarede
  • 3,310
  • 4
  • 44
  • 68
0
votes
0 answers

R-Tree implementation in Java

Possible Duplicate: R-Tree Implementation Java Are there any r-tree implementations in Java that can support an arbitrary number of dimensions? I have only found java r-tree implementations for 2D data.
pm3310
  • 119
  • 1
  • 2
  • 9
0
votes
2 answers

How to bulk-load an r-tree in C#?

I am looking for C# code to construct an r-tree. I have code that builds an r-tree incrementally i.e. items are added one by one to the tree, but I guess a better r-tree could be built if all items are given all at once to the tree creation…
morpheus
  • 18,676
  • 24
  • 96
  • 159
0
votes
1 answer

Is there an algorithm, which can partition the space into N number of partitions given a random number N, where N<50

I read about R-Tree, kd-tree, bounding interval hierarchy etc for space-partitioning. I found that these data structures are useful for spatial querying. Although, they do partitioning, but I do not know how to retrieve those partitions from the…
justin waugh
  • 885
  • 3
  • 12
  • 22
-1
votes
1 answer

Mac m1, rtree 0.9.7, spatialindex 1.9.3, symbol not found

() isikkaplan@iamhere# python3 manage.py loadfixtures -s=testing fixture fixtures/knock/0_ct.json -v3 Traceback (most recent call last): File "/Users/isikkaplan/Desktop/code/---/-/--/manage.py", line 21, in main() File…
Işık Kaplan
  • 2,815
  • 2
  • 13
  • 28
-1
votes
1 answer

how to calculate r-tree's height?

i have a deep doubt about r'tree's height. if leaf node : N, fanout : m then r'tree's max height : log m (N) - 1 ? why this differs from b'tree?
user726724
  • 1
  • 2
-1
votes
1 answer

Minimum Bounding Rectangle calculation in Boost R-Tree

Minimum Bounding Rectangles is a pre-requisite for R-Tree creation. What algorithm does Boost C++ library use for MBR creation given a set of points?
user11233302
  • 1
  • 1
-1
votes
1 answer

R-tree Range Query and Nearest Neighbor Search in Python

where can I find an efficient implementation of R-tree and the range query and neighbor searching especially in Python? Want to understand how these queries work using the code.(i am a beginner)
user9500575
  • 1
  • 4
-1
votes
1 answer

R-tree query/bounding box for an intersection

I'm trying to create a function for an intersection where the input file is of buildings in some urban area, and a query box is used to create an intersection containing just the buildings found in that query box area. import matplotlib.pyplot as…
Joe Gates
  • 9
  • 2
-1
votes
1 answer

Find the set of all points that are contained in a moving sphere

I have a finite set P of several thousands of sparse points in the 3d space and a moving sphere S of fixed radius. For every given moment t I know S_t, i.e. the volume of space occupied by the sphere. I don't know beforehand in which direction S is…
Luigi D.
  • 165
  • 1
  • 10
-1
votes
1 answer

Which data structure should I use to store large 10,000 data set and do fastest search ,and take least memory?

*Suppose I have 10,000 circle(x,y,r) values , and i want to find a point (p1,p2) lies in which circle , to get fastest response for this query what data structure should i use to store those 10,000 circle data. It is a static data ,means one time…
SK17
  • 182
  • 4
  • 15
-1
votes
1 answer

B-Tree K-D-B Tree and R-Tree improve search

How can B-Tree K-D-B Tree and R-Tree help improve efficiency and accuracy of the search.
Nuttanon Pornpipak
  • 19
  • 3
-1
votes
2 answers

Range search in Multi_dimensional R-Trees

I am trying to implement R-Tree in C++. While implementing Range Queries, I find that I have to check for the intersection of a point (with a given range), with a multi-dimensional hyper rectangle. Any idea how this could be done? For 2D case I…
hacker315
  • 1,996
  • 2
  • 13
  • 23
-1
votes
2 answers

How do tree searches deal with edge errors in nearest-neighbor searches?

Concerning tree searching algorithms, particularly quad-tree and r-tree, how do they account for edge errors when finding nearest neighbors. I'm not good at explaining this with words so I made some pictures. For the picture the input coordinate to…
wowohweewah
  • 429
  • 5
  • 16
1 2 3
…
17
18