Any good range Query library(using K-D tree, quad tree or R-tree) in C++

Question

I used this library before http://www.cs.umd.edu/~mount/ANN/. However, they don't provide range query implementations. I Guess is there a C++ range-query implementation (Both circle or rectangle), to query two-dimensional data.

Thanks.

Answer 1

I use

boost::geometry::index::rtree. 

For more information, see here, and for an example here.