A Python implementation of Priority R-Tree, an alternative to RTree.
Flatbush for C++
Data Structure: RTree - core, allow to handle Polygons in 2D.
Repository for all assignments of the course COL761: Data Mining (Fall 2020), taught at IIT Delhi
⚡ High-performance computing using OpenMPI
Implementation of classical / parallel DBSCAN using an R*-Tree for structuring the data.
A Python port of the mourner/rbush - a high-performance R-tree-based 2D spatial index for points and rectangles
R+-Tree with augmentations to support Textual-Spatial-Queries
This implementation creates an RTree object with a specified maximum number of children per node, and allows for the insertion of Rect objects into the tree. It also provides a search function that returns all Rect objects that overlap with a given query rectangle. The implementation uses a recursive algorithm to build and search the R-tree, and ..
🌳 R-tree for indexing and searching spatial geometries
Example of Pareto Front Calculation Using R-Tree With C++ And Boost
Add a description, image, and links to the r-tree topic page so that developers can more easily learn about it.
To associate your repository with the r-tree topic, visit your repo's landing page and select "manage topics."