Spatial index library with R*Tree, STR-Tree, Quadtree, CritBit, KD-Tree, CoverTree and PH-Tree
-
Updated
Aug 11, 2024 - Java
Spatial index library with R*Tree, STR-Tree, Quadtree, CritBit, KD-Tree, CoverTree and PH-Tree
Simple implementation of spatial skyline query algorithms
Spatial indexing algorithms for java
mqr-tree spatial index
Used as our groups second semester Advanced Programming and Data Structure project
Implementation of R*-tree for spatial data organisation and processing.
Graph + Trees | Dijkstra + R-Tree + BST Tree | University Project
Custom implementation of a Graph, Binary Tree, R Tree and HashMap in Java, and comparison of its performance as data structures
Algoritmos y conceptos en Programación Avanzada y Estructurada de Datos .
Java implementation of the R-Tree, an in-memory index designed to query 2D data efficiently
Comparing the Cost and Efficiency of Nearest Neighbour Search in K-d Trees versus R-Trees
An implementation of a database engine with support for B+ trees and R trees indexing
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."