CGAL users discussion list

[nojhan <>]

I failed to find an elegant way to call a spatial search on an Arrangement.

My current approach is to copy all the points that are related to the vertices of the arrangement into a new container, and perform the search on it.

// something like that:
Vector arr_vertices;
for( auto EACH_VERTICES(iv, arr) ) {
  arr_vertices.push_back( iv->point() );
}
Tree tree( ITEMS(arr_vertices) );
NN_incremental_search search( tree, query );

Would it be possible to have an interface in the spatial search that would directly use a point method instead of the Point instance? This would avoid the need to copy the arrangement vertices.

---

View this message in context: Spatial search in Arrangement
Sent from the cgal-discuss mailing list archive at Nabble.com.