#算法刷题#RBush — a high-performance JavaScript R-tree-based 2D spatial index for points and rectangles
#算法刷题#A very fast static spatial index for 2D points and rectangles in JavaScript 🌱
#计算机科学#🏅State-of-the-art learned data structure that enables fast lookup, predecessor, range searches and updates in arrays of billions of items using orders of magnitude less space than traditional indexes
翻译 - learned先进的学习数据结构，可在数十亿个项目的阵列中以比传统索引少几个数量级的空间进行快速查找，前身，范围搜索和更新
#算法刷题#A fast static index for 2D points
Boost.Geometry - Generic Geometry Library | Requires C++14 since Boost 1.75
#算法刷题#2D polyline library for offsetting, combining, etc.
#算法刷题#The fastest spatial index for geographic locations in JavaScript
Interactive details-on-demand data visualizations at scale
RTree2D is a 2D immutable R-tree for ultra-fast nearest and intersection queries in plane and spherical coordinates
A dynamic, loose octree implementation written in C# as a .NET Standard 2.1 library
Templated hierarchical spatial trees designed for high-peformance.
Java utilities for transforming distance along N-dimensional Hilbert Curve to a point and back. Also supports range splitting queries on the Hilbert Curve.
🌐 Search for nearby locations without DB usage.
#算法刷题#GeoJSON implementation of RBush — a high-performance JavaScript R-tree-based 2D spatial index for points and rectangles
Simple non-academic performance comparison of available open source implementations of R-tree spatial index using linear, quadratic and R* balancing algorithms as well as bulk loading.
An elixir implementation of Rtree, optimized for fast updates.
Fast static 2D axis aligned bounding box index