RBush

RBush is a high-performance JavaScript library for 2D spatial indexing of points and rectangles. It's based on an optimized R-tree data structure with bulk insertion support.

Spatial index is a special data structure for points and rectangles that allows you to perform queries like "all items within this bounding box" very efficiently (e.g. hundreds of times faster than looping over all items). It's most commonly used in maps and data visualizations.

Demos

The demos contain visualization of trees generated from 50k bulk-loaded random points. Open web console to see benchmarks; click on buttons to insert or remove items; click to perform search under the cursor.

• randomly clustered data
• uniformly distributed random data

Install

Install with NPM (npm install rbush), or use CDN links for browsers: rbush.js, rbush.min.js

Usage

Creating a Tree

var tree = rbush();

An optional argument to rbush defines the maximum number of entries in a tree node. 9 (used by default) is a reasonable choice for most applications. Higher value means faster insertion and slower search, and vice versa.

var tree = rbush(16);

Adding Data

Insert an item:

var item = {
    minX: 20,
    minY: 40,
    maxX: 30,
    maxY: 50,
    foo: 'bar'
};
tree.insert(item);

Removing Data

Remove a previously inserted item:

tree.remove(item);

By default, RBush removes objects by reference. However, you can pass a custom equals function to compare by value for removal, which is useful when you only have a copy of the object you need removed (e.g. loaded from server):

tree.remove(itemCopy, function (a, b) {
    return a.id === b.id;
});

Remove all items:

tree.clear();

Data Format

By default, RBush assumes the format of data points to be an object with minX, minY, maxX and maxY properties. You can customize this by providing an array with corresponding accessor strings as a second argument to rbush like this:

var tree = rbush(9, ['[0]', '[1]', '[0]', '[1]']); // accept [x, y] points
tree.insert([20, 50]);

If you're indexing a static list of points (you don't need to add/remove points after indexing), you should use kdbush which performs point indexing 5-8x faster than RBush.

Bulk-Inserting Data

Bulk-insert the given data into the tree:

tree.load([item1, item2, ...]);

Bulk insertion is usually ~2-3 times faster than inserting items one by one. After bulk loading (bulk insertion into an empty tree), subsequent query performance is also ~20-30% better.

Note that when you do bulk insertion into an existing tree, it bulk-loads the given data into a separate tree and inserts the smaller tree into the larger tree. This means that bulk insertion works very well for clustered data (where items in one update are close to each other), but makes query performance worse if the data is scattered.

Search

var result = tree.search({
    minX: 40,
    minY: 20,
    maxX: 80,
    maxY: 70
});

Returns an array of data items (points or rectangles) that the given bounding box intersects.

Note that the search method accepts a bounding box in {minX, minY, maxX, maxY} format regardless of the format specified in the constructor (which only affects inserted objects).

var allItems = tree.all();

Returns all items of the tree.

Collisions

var result = tree.collides({minX: 40, minY: 20, maxX: 80, maxY: 70});

Returns true if there are any items intersecting the given bounding box, otherwise false.

Export and Import

// export data as JSON object
var treeData = tree.toJSON();

// import previously exported data
var tree = rbush(9).fromJSON(treeData);

Importing and exporting as JSON allows you to use RBush on both the server (using Node.js) and the browser combined, e.g. first indexing the data on the server and and then importing the resulting tree data on the client for searching.

Note that the nodeSize option passed to the constructor must be the same in both trees for export/import to work properly.

K-Nearest Neighbors

For "k nearest neighbors around a point" type of queries for RBush, check out rbush-knn.

Performance

The following sample performance test was done by generating random uniformly distributed rectangles of ~0.01% area and setting maxEntries to 16 (see debug/perf.js script). Performed with Node.js v6.2.2 on a Retina Macbook Pro 15 (mid-2012).

Test	RBush	old RTree	Improvement
insert 1M items one by one	3.18s	7.83s	2.5x
1000 searches of 0.01% area	0.03s	0.93s	30x
1000 searches of 1% area	0.35s	2.27s	6.5x
1000 searches of 10% area	2.18s	9.53s	4.4x
remove 1000 items one by one	0.02s	1.18s	50x
bulk-insert 1M items	1.25s	n/a	6.7x

Algorithms Used

• single insertion: non-recursive R-tree insertion with overlap minimizing split routine from R*-tree (split is very effective in JS, while other R*-tree modifications like reinsertion on overflow and overlap minimizing subtree search are too slow and not worth it)
• single deletion: non-recursive R-tree deletion using depth-first tree traversal with free-at-empty strategy (entries in underflowed nodes are not reinserted, instead underflowed nodes are kept in the tree and deleted only when empty, which is a good compromise of query vs removal performance)
• bulk loading: OMT algorithm (Overlap Minimizing Top-down Bulk Loading) combined with Floyd–Rivest selection algorithm
• bulk insertion: STLT algorithm (Small-Tree-Large-Tree)
• search: standard non-recursive R-tree search

Papers

• R-trees: a Dynamic Index Structure For Spatial Searching
• The R*-tree: An Efficient and Robust Access Method for Points and Rectangles+
• OMT: Overlap Minimizing Top-down Bulk Loading Algorithm for R-tree
• Bulk Insertions into R-Trees Using the Small-Tree-Large-Tree Approach
• R-Trees: Theory and Applications (book)

Development

npm install  # install dependencies

npm test     # check the code with JSHint and run tests
npm run perf # run performance benchmarks
npm run cov  # report test coverage (with more detailed report in coverage/lcov-report/index.html)

Compatibility

RBush should run on Node and all major browsers. The only caveat: IE 8 needs an Array#indexOf polyfill for remove method to work.

Changelog

2.0.2 — Dec 21, 2017

• Added default export for better ES6 modules / transpiler support.

2.0.1 — June 29, 2016

• Fixed browser builds in NPM.

2.0.0 — June 29, 2016

• Breaking: changed the default format of inserted items from [20, 40, 30, 50] to {minX: 20, minY: 40, maxX: 30, maxY: 50}.
• Breaking: changed the search method argument format from [20, 40, 30, 50] to {minX: 20, minY: 40, maxX: 30, maxY: 50}.
• Improved performance by up to 30%.
• Added equalsFn optional argument to remove to be able to remove by value rather than by reference.
• Changed the source code to use CommonJS module format. Browser builds are automatically built and published to NPM.
• Quickselect algorithm (used internally) is now a separate module.

1.4.3 — May 17, 2016

• Fixed an error when inserting many empty bounding boxes.

1.4.2 — Dec 16, 2015

• 50% faster insertion.

1.4.1 — Sep 16, 2015

• Fixed insertion in IE8.

1.4.0 — Apr 22, 2015

• Added collides method for fast collision detection.

1.3.4 — Aug 31, 2014

• Improved bulk insertion performance for a large number of items (e.g. up to 100% for inserting a million items).
• Fixed performance regression for high node sizes.

1.3.3 — Aug 30, 2014

• Improved bulk insertion performance by ~60-70%.
• Improved insertion performance by ~40%.
• Improved search performance by ~30%.

1.3.2 — Nov 25, 2013

• Improved removal performance by ~50%. #18

1.3.1 — Nov 24, 2013

• Fixed minor error in the choose split axis algorithm. #17
• Much better test coverage (near 100%). #6

1.3.0 — Nov 21, 2013

• Significantly improved search performance (especially on large-bbox queries — up to 3x faster). #11
• Added all method for getting all of the tree items. #11
• Made toBBox, compareMinX, compareMinY methods public, made it possible to avoid Content Security Policy issues by overriding them for custom format. #14 #12

1.2.5 — Nov 5, 2013

• Fixed a bug where insertion failed on a tree that had all items removed previously. #10

1.2.4 — Oct 25, 2013

• Added Web Workers support. #9

1.2.3 — Aug 30, 2013

• Added AMD support. #8

1.2.2 — Aug 27, 2013

• Eliminated recursion when recalculating node bboxes (on insert, remove, load).

1.2.0 — Jul 19, 2013

First fully functional RBush release.