RBush — a high-performance JavaScript R-tree-based 2D spatial index for points and rectangles
-
Updated
Aug 21, 2024 - JavaScript
RBush — a high-performance JavaScript R-tree-based 2D spatial index for points and rectangles
an R-Tree library for Go
A very fast static spatial index for 2D points and rectangles in JavaScript 🌱
Spatial index library with R*Tree, STR-Tree, Quadtree, CritBit, KD-Tree, CoverTree and PH-Tree
GeoJSON implementation of RBush — a high-performance JavaScript R-tree-based 2D spatial index for points and rectangles
RBush-3D — a high-performance JavaScript R-tree-based 3D spatial index for points and cuboids
Spatial data indexing in pure Julia (R*-trees etc)
Simple implementation of spatial skyline query algorithms
An on-disk, Codable R*-Tree for Swift
TypeScript implementation of a Hilbert Packed R-Tree without external dependencies
Spatial indexing algorithms for java
Java implementation of the R-Tree, an in-memory index designed to query 2D data efficiently
A library for spatially indexing kD bounding box data (based on libspatialindex)
Generic RTree for Nim
R-Tree Data Structure for Spatial Indexing
A Python implementation of Priority R-Tree, an alternative to RTree.
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."