Python wrapper for Boost Geometry Rtree
-
Updated
Apr 19, 2019 - C++
Python wrapper for Boost Geometry Rtree
Grid-mapped Interval Trees (G-IT) for Spatiotemporal Trajectories
On-Disk Implementation of R-Tree with Insertion and Bulk Load. This data structure efficiently stores and retrieve multi-dimensional data, very similar to B+ Tree where data is 1D though.
High dimensional indexing of image data using rtree, implemented to find similar images in the indexed dataset
A demonstration of the R-Tree data structure. Currently it can only support adding points and deletion is not allowed. A quadratic split strategy has been adopted to split an overflow node.
Fast distances in Python
Rtree building and query processing
Advanced Line Follower using Machine Learning
Project 3 for Databases 2 Course: Image similarity search using different KNN techniques.
Algorithm related projects
Benchmark for spatial index libraries with file storage
In-memory implementation of the go-whosonfirst-spatial interfaces.
Stores and searches through 360 degree pictures
WebApp implementada en Python, Flask y OpenCV para realizar búsquedas espaciales (KNN) sobre el dataset Labeled Faces in the Wild almacenado en una estructura RTree, encodificando los vectores característicos de un rostro arbitrario para realizar una búsqueda eficiente.
Add a description, image, and links to the rtree topic page so that developers can more easily learn about it.
To associate your repository with the rtree topic, visit your repo's landing page and select "manage topics."