external/rtree/README.md
A C++ templated version of this RTree algorithm. The code it now generally compatible with the STL and Boost C++ libraries.
#include <RTree.h>
// ...
RTree<Foo*, double, 3> tree;
double min[3] = {0., 0., 0.};
double max[3] = {1., 1., 1.};
Foo* bar = new Foo();
tree.Insert(min, max, bar);
Provides search in and iteration over the tree. For examples see Test.cpp
Run make to build and make test to run the tests. The RTree itself is
a single header file and can be included without compiling.
Original code was taken from http://www.superliminal.com/sources/sources.htm and is stored as git revision 0. This revision is entirely free for all uses. Enjoy!
Due to restrictions on public domain in certain jurisdictions, code contributed by Yariv Barkan is released in these jurisdictions under the BSD, MIT or the GPL - you may choose one or more, whichever that suits you best.
In jurisdictions where public domain property is recognized, the user of this software may choose to accept it either 1) as public domain, 2) under the conditions of the BSD, MIT or GPL or 3) any combination of public domain and one or more of these licenses.
Thanks Baptiste Lepilleur for the licensing idea.
std::function