CGAL users discussion list

[Philippe GAMBRON <>]

Hi Sébastien,

Thank you very much for your quick reply.


> For your first question using k-nearest neighbor search with k=1 will 
> make it (insert your points in the tree and make the query with your
> point). See example here:
> http://www.cgal.org/Manual/latest/doc_html/cgal_manual/Spatial_searching/Chapter
> _main.html#Subsection_59.3.1

This is what I was looking for.


> For the second one, a naive method is to use the first method 
> iteratively over all the points of one set and take the pair with
> smallest distance. If you have performance issues, probably filtering
> points with bbox should be more efficient.

I will explore that because I have indeed performance issues.

Thank you!

Best regards,

Philippe