A really fast static spatial index for 2D points and rectangles in JavaScript. An efficient implementation of the packed Hilbert R-tree algorithm. Enables fast spatial queries on a very large number of objects (e.g. millions), which is very useful in maps, data visualizations and computational geometry algorithms.
Features
- You can't add/remove items after initial indexing
- Indexing and search, with much lower memory footprint
- Index is stored as a single array buffer
- You can transfer it between threads or store it as a compact binary file
- Supports geographic locations with the geoflatbush extension
- Use a browser build directly
Categories
AlgorithmsLicense
ISC LicenseFollow Flatbush
Other Useful Business Software
$300 Free Credits to Build on Google Cloud
Start your next project with $300 in free Google Cloud credit. Spin up VMs, run containers, query petabytes in BigQuery, or build agents with Gemini Enterprise Agent Platform. Once your credits are used, keep building with 20+ always-free tier products including Compute Engine, Cloud Storage, GKE, and Cloud Run functions. No commitment required—just sign up and start building.
Rate This Project
Login To Rate This Project
User Reviews
Be the first to post a review of Flatbush!