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 Free Credits for Your Google Cloud Projects Icon
$300 Free Credits for Your Google Cloud Projects

Start building on Google Cloud with $300 in free credits. No commitment, no credit card required until you're ready to scale.

Launch your next project with $300 in free Google Cloud credits—no strings attached. Test, build, and deploy without risk. Use your credits across the entire Google Cloud platform to find what works best for your needs. After your credits are used, continue with always-free tier services. Only pay when you're ready to scale. Sign up in minutes and start exploring.
Start Free Trial
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