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

how to get bounds in rtree

I have a rtree, which contains points, i.e. where left == right && top == bottom: ... idx = index.Index() .... *print list(idx.nearest((rand_point[0], rand_point[1], rand_point[0], rand_point[1]))) ... left, bottom, right, top = (newpoint[0],…
Olga
  • 982
  • 1
  • 11
  • 17
-1
votes
3 answers

Indexing in MySQL

I have a table like below CREATE TABLE `key_word` ( `primary_key` bigint(20) NOT NULL, `indexVal` int(11) NOT NULL, `hashed_word` char(3) NOT NULL, PRIMARY KEY (`primary_key`) ) ENGINE=MyISAM DEFAULT CHARSET=latin1 Here is how I am going to…
PeakGen
  • 21,894
  • 86
  • 261
  • 463
-1
votes
1 answer

child node in MBR (R-Tree Implementation)

I am new to R-Tree concept. Sorry If I ask a very basic question related to Rtree. I have read a few literature on R-Tree to get the basic concept of R-Tree. However, I could not understand the clustering or grouping steps in MBR. What's bothering…
user3030823
  • 107
  • 1
  • 1
  • 6
-2
votes
1 answer

Geodjango - in memory r-tree index

How can I create an r-tree index in memory, using Geodjango? I have a number of fixed polygons (hardcoded) and I would like to check in which of these polygons does a point belong. I would like to do this in memory to avoid being dependent on a…
Helgi Borg
  • 835
  • 10
  • 32
-2
votes
1 answer

R-tree indexing in Postgresql 9.3

How can I use gist in Postgres to fast query a two dimensional geographic data in double precision? For example, I have a table Points, which has three fields: point_id, X and Y and I want to use Postgres to quickly query point for which a < x < b…
Moke Mao
  • 21
  • 1
-2
votes
1 answer

Using R-Trees in SQL

TLDR: What is the best way to store spatial data in an SQL database to be used in R-Trees? Long question: I am writing a feature that incorporates spatial data. The goal is to store POIs and being able to retrieve the data quickly, perform…
A.L.
  • 144
  • 2
  • 9
-2
votes
2 answers

count the frequency of groups in vector using rtree ( or any other algorithm )

given following set of points in a vector {( 100, 150 ), ( 101, 152 ), ( 102, 151 ), ( 105, 155 ), ( 50, 50 ), ( 51, 55 ), ( 55, 55 ), ( 150, 250 ), ( 190, 260 ) } I need to identify neighboring points and their count. Let us say the acceptable…
Prem
  • 355
  • 2
  • 17
-4
votes
1 answer

Convert from java to scala

I am making an r-tree and I have some problem to convert from java to scala this line of code private RTree.Node chooseLeaf(RTree.Node n, RTree.Entry e) Whatever I try it ends up in error. Any suggestion to solve my problem will be…
nik
  • 1
  • 1
1 2 3
…
17
18