CGAL users discussion list

[Johannes Otepka <>]

Mohammad,

With the CGAL::Orthogonal_k_neighbor_search class you can do both 
nearest and furthest neighbor searching within D-dimensions.
http://www.cgal.org/Manual/3.3/doc_html/cgal_manual/Spatial_searching/Chapter_main.html#Subsection_45.3.3

Neighbor_search N1(tree, query, K, 0.0, true);  //nearest query
Neighbor_search N1(tree, query, K, 0.0, false); //furthest query

cheers,
 johannes



> Hello,
>
> Does anyone know whether CGAL has a faster implementation to obtain 
> the farthest point from a given set of points in D-dimension. Please
> let me know,
>
> Thank you!
>
> Mohammad 
>
>