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

Flatbush Screenshot 1

Project Activity

See All Activity >