tinyr

Fast 2D R-Tree implementation in cython

An R-Tree is an index structure for storing objects with a spatial key. In general, an R-Tree allows insertion and searching in N-dimensional space. However, for a certain amount of use cases it is sufficient to work in a 2D space, what makes the implementation simpler and potentially faster.

Having an R-Tree made in Cython means it is compiled as a C Python extension.