CGAL users discussion list

["Sebastien Loriot (GeometryFactory)" <>]

Have a look at the second example here:

http://www.cgal.org/Manual/latest/doc_html/cgal_manual/Spatial_searching/Chapter_main.html#Subsection_61.3.6

Sebastien.

On 03/21/2013 04:44 PM, Julian wrote:
> I'm trying to find an example of an algorithm in CGAL that will accept a
> large set of 3D point positions (circa 1m) distributed randomly in space
> and, given a single input position, find the nearest point position in
> the set to that input position. I think it should be one of the 'nearest
> neighbor' searches (particularly in Section 61.3.5 of the manual) but I
> can't quite work out how to return the point position itself as well as
> the actual distance. Or, if not the point position, the index of the
> input point. Is this possible?
>
> Thanks,
> Julian