R-Tree Search Algorithm Implementation

Hello Everyone

I am using spatial data to query geographical locations

I used a library to build an R-tree from the dataset

[login to view URL]

what I need to do now is to implement my search algorithm using functions defined in the library

---------------------

if I need to search for a particular location then I would send a range query representing a rectangle of two coordinate pairs.

(x_low , y_low) for the bottom left corner

(x_high , y_high) for the upper right corner

the nodes of the Rtree will contain bounding boxes of the same representation also, i.e x_low, y_low etc

what I need to do is as follows:

perform subtraction of the alternate coordinate (coordinate pairs of the query minus coordinate pair of the rectangles in the Rtree)

after obtaining the subtraction result, it can be decided whether there is an intersection between the query and the rectangle of the Rtree or not

This is in short the whole process of searching, i.e finding the intersection between a query rectangle and an Rtree rectangle

I know what library functions to use in order to achieve this.

My main problem lies in understanding these functions and using their attributes to code my algorithm

Who can help me? Please place "I know R-Tree" in your header of bid

additional files are attached.

Thank you

Algoritme Python Matematik

Projekt ID: #28125971

Om projektet