[https://en.wikipedia.org/wiki/R-tree](https://en.wikipedia.org/wiki/R-tree)
I assume not yet. For Ruby I used my custom bindings to boost library for this. But as the RTree algorithm is not too complex, a native Nim implementation may be preferable over a Nim Boost-Rtree wrapper. I guess we would have to use Concepts for a native Nim RTree? Next question would be if one would start with the plain paper from 1984/1990 or with an already existing implementation. There are C, C++, Java, Go and many more implementations. I think the Nim API may look similar as the Go one -- Go is using Interfaces. [https://github.com/dhconnelly/rtreego](https://github.com/dhconnelly/rtreego)
