CGAL users discussion list

[Sylvain Pion <>]

Why not use the nearest_vertex() function of CGAL::Delaunay_triangulation_2 ?

http://doc.cgal.org/latest/Triangulation_2/classCGAL_1_1Delaunay__triangulation__2.html#adb30f1add2dc055ed5582be4220bc290

2014-02-11 Andreas Fabri <>:

What header file do you include?
The function you do not find is in

#include <CGAL/nearest_neighbor_delaunay_2.h>

Sorry for this documentation bug.

andreas

On 11/02/2014 16:47, Andreas Fabri wrote:

Hello,

As a workaround, you may try the member function
instead of the global function.

http://doc.cgal.org/latest/Point_set_2/classCGAL_1_1Point__set__2.html

best,

andreas

On 11/02/2014 16:30, cdoucet wrote:

Hello,

I need to be able to find the nearest neighbor of a given point among the
vertices of a Delaunay triangulation.

My triangulation T is constructed from
     Delaunay T(points.begin(),points.end())
where 'points' is a set of nodes.

I have seen in the documentation of CGAL that there exists a function
     Dt::Vertex_handle CGAL::nearest_neighbor (const Dt &delau,
Dt::Vertex_handle v)
(see
http://doc.cgal.org/latest/Point_set_2/group__PkgPointSet2NeighborSearch.html)


However, I do not manage to use it.
My compiler claims that CGAL::nearest_neighbor does not exist.
I may do something wrong but I cannot find it.

Is there an header to be included?
Where can I find constructors of Dt::Vertex_handle?

Thank you very much for your help.

Best regards,

Cédric Doucet








--
View this message in context:
http://cgal-discuss.949826.n4.nabble.com/Nearest-neighbor-query-in-a-Delaunay-triangulation-tp4658803.html

Sent from the cgal-discuss mailing list archive at Nabble.com.

--
Andreas Fabri, PhD
Chief Officer, GeometryFactory
Editor, The CGAL Project

phone: +33.492.954.912    skype: andreas.fabri

--
You are currently subscribed to cgal-discuss.
To unsubscribe or access the archives, go to
https://sympa.inria.fr/sympa/info/cgal-discuss