CGAL users discussion list

["Sebastien Loriot (GeometryFactory)" <>]

The orthogonal search is the fastest one:
http://doc.cgal.org/latest/Spatial_searching/classCGAL_1_1Orthogonal__k__neighbor__search.html


You can start from this example:
http://doc.cgal.org/latest/Spatial_searching/Spatial_searching_2searching_surface_mesh_vertices_8cpp-example.html


Sebastien.

On 06/27/2016 03:44 PM, Michael Klatt wrote:
> Dear all,
>
> I have found your very interesting package "dD Spatial Searching". I want to
> use it to find nearest neighbors. However, I am unsure which of the
> algorithms that you implemented is the most efficient in my setting. May I
> ask for your advice?
>
> Given a fine mesh P of points (with some larger holes in it) and another
> (much) sparser set of points Q in d dimensions, I want to find for each
> point in P the nearest neighbor in Q as well as the corresponding Euclidean
> distance.
>
> Here is a simple example:
> <http://cgal-discuss.949826.n4.nabble.com/file/n4662013/point-sets.png>
>
> Can you advise me which algorithm I should use?
> To which of your examples in the manual does this correspond?
>
> Thank you very much!
> Best regards,
>
> Michael
>
>
>
> --
> View this message in context: 
> http://cgal-discuss.949826.n4.nabble.com/Which-algorithm-should-I-use-to-find-the-nearest-neighbors-tp4662013.html
> Sent from the cgal-discuss mailing list archive at Nabble.com.