FilesExpand file tree

 master

/

rtreeExample.py

Copy path

Blame

More file actions

Blame

More file actions

Latest commit

 

History

History

History

32 lines (27 loc) · 1005 Bytes

 master

/

rtreeExample.py

Copy path

Top

File metadata and controls

• Code
• Blame

32 lines (27 loc) · 1005 Bytes

Raw

Copy raw file

Download raw file

Open symbols panel

Edit and raw actions

1

2

3

4

5

6

7

8

9

10

11

12

13

14

15

16

17

18

19

20

21

22

23

24

25

26

27

28

29

30

31

'''

RTREE is a spatial index that answers the question ->

What points are within this 2-dimensional box.

RTREE helps us speed up other calculations by only considering legitimate

objects for more complex comparisons.

'''

from rtree import Rtree

# instantiate the Rtree class

idx = Rtree()

# create a selection boundary (2d bounding box)

minx, miny, maxx, maxy = (0.0, 0.0, 1.0, 1.0)

# add an item to the index

idx.add(0, (minx, miny, maxx, maxy))

# Intersect another bounding box with the original bounding box.

list(idx.intersection((1.0, 1.0, 2.0, 2.0)))

#[0L]

# Point out the accuracy of the spatial calculation

list(idx.intersection((1.0000001, 1.0000001, 2.0, 2.0)))

#[]

#add another item to the index. - show EXACT dimensiion matching

index.add(id=id, (left, bottom, right, top))

object = [n for n in index.intersection((left, bottom, right, top))]

#[id]

# Find nearest object / bounding box

idx.add(1, (minx, miny, maxx, maxy))

list(idx.nearest((1.0000001, 1.0000001, 2.0, 2.0), 1))

#[0L, 1L]