I have made a few simple Cartesian Point to Point tests:
rtree.qbegin(bgi::nearest(Point(4, 4), 2))
and they were sorted in Boost 1.61.
Now I'd like a documentation or source quote to confirm it.
If not, I will just sort the query output myself afterwards.
[Note] In the case of iterative k-NN queries it is guaranteed to iterate over the closest Values first.
For K Nearest Neighbours boost::geometry guarantees to iterate over closest values first.
Source
If you love us? You can donate to us via Paypal or buy me a coffee so we can maintain and grow! Thank you!
Donate Us With