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

Project Samples

Project Activity

See All Activity >

Categories

Algorithms

License

ISC License

Follow Flatbush

Flatbush Web Site

Other Useful Business Software
$300 in Free Credit Towards Top Cloud Services Icon
$300 in Free Credit Towards Top Cloud Services

Build VMs, containers, AI, databases, storage—all in one place.

Start your project in minutes. After credits run out, 20+ products include free monthly usage. Only pay when you're ready to scale.
Get Started
Rate This Project
Login To Rate This Project

User Reviews

Be the first to post a review of Flatbush!

Additional Project Details

Programming Language

JavaScript

Related Categories

JavaScript Algorithms

Registered

2022-02-25