A relatively simple implementation of the R* Tree data structure for C++
LGPL-2.1 License
In 2008 I created this R* Tree implementation in C++. My goal for this implementation was as follows:
This is a header-only implementation of an R tree with an R* index, and makes heavy use of templates, STL, and STL-style functors; but it should work in any relatively modern C++ compiler. To do searching for nodes, this implementation uses the Visitor pattern via functors there are examples and documentation in RStarVisitor.h.
I do not use or update this code anymore, but I welcome pull requests.
GNU Lesser Public License v2.1
Dustin Spicuzza ([email protected])