- It is fast: search and insertion are very fast. It performs up to 50000-100000 insertions per second on modern browsers.
- It is memory-efficient: since RTree's are often used in visualization software, you do not want low level components to spam memory for the garbage collector to clean up. This implementation has a very conservative memory usage profile.
- It is modular: Often times, you might have your own data model which represents an bounding
box. This RTree allows you to plugin objects with your own
Envelope. You can also override the default node split implementation or the default expansion cost function.
Show the current tree (not for the faint of heart):