Geometry Boost List: [geometry] Group Nearest Neighbour queries using nearest() predicate

Subject: [geometry] Group Nearest Neighbour queries using nearest() predicate
From: oliveoil_s (nusratst.cse_at_[hidden])
Date: 2014-03-28 00:12:22

I have been using boost to implement some spatial query related algorithm.
But i am stuck in a problem . 
I need to know whether boost already support r-tree functions for Group of
points.
So far i have found that nearest() predicate gives knn for only a single
point . Is it possible or is it already implemented in Boost to search for
multiple point ? 
Like for example , I want to find group-knn for 3 points,
point(0,0),point(100,30),point(200,60)
bgi::nearest({point(0,0),point(100,30),point(200,60)}, 5)  .

There are other functions like sum,max,min,range query for group of points.
Are those already supported in boost ?

--
View this message in context: http://boost-geometry.203548.n3.nabble.com/Group-Nearest-Neighbour-queries-using-nearest-predicate-tp4025904.html
Sent from the Boost Geometry mailing list archive at Nabble.com.