...one of the most highly
regarded and expertly designed C++ library projects in the
world.
— Herb Sutter and Andrei
Alexandrescu, C++
Coding Standards
Generate nearest() predicate.
When nearest predicate is passed to the query, knearest neighbour search
will be performed. nearest()
predicate takes a
from which distances to Geometry
are calculated and the maximum number of Values
that should be returned. Internally boost::geometry::comparable_distance()
is used to perform the calculation.
Values
template<
typename Geometry
>
detail::nearest<Geometry> boost::geometry::index::nearest
(
Geometry const &
geometry
,
unsigned
k
)
Type 
Name 
Description 



The geometry from which distance is calculated. 


The maximum number of values to return. 
bgi::query(spatial_index, bgi::nearest(pt, 5), std::back_inserter(result)); bgi::query(spatial_index, bgi::nearest(pt, 5) && bgi::intersects(box), std::back_inserter(result)); bgi::query(spatial_index, bgi::nearest(box, 5), std::back_inserter(result));
Warning  

Only one 