Subject: CGAL users discussion list
List archive
- From: Cedric Doucet <>
- To:
- Subject: Re: [cgal-discuss] Nearest neighbor query in a Delaunay triangulation
- Date: Wed, 12 Feb 2014 09:20:20 +0100 (CET)
Hello,
thank you very much for your help Andreas and Sylvain!
I finally managed to do what I want by including CGAL/Delaunay_triangulation_3.h> and using nearest_vertex function.
Best regards,
Cédric Doucet
De: "Sylvain Pion" <>
À:
Envoyé: Mardi 11 Février 2014 22:01:07
Objet: Re: [cgal-discuss] Nearest neighbor query in a Delaunay triangulationWhy not use the nearest_vertex() function of CGAL::Delaunay_triangulation_2 ?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
- [cgal-discuss] Nearest neighbor query in a Delaunay triangulation, cdoucet, 02/11/2014
- Re: [cgal-discuss] Nearest neighbor query in a Delaunay triangulation, Andreas Fabri, 02/11/2014
- Re: [cgal-discuss] Nearest neighbor query in a Delaunay triangulation, Andreas Fabri, 02/11/2014
- Re: [cgal-discuss] Nearest neighbor query in a Delaunay triangulation, Sylvain Pion, 02/11/2014
- Re: [cgal-discuss] Nearest neighbor query in a Delaunay triangulation, Cedric Doucet, 02/12/2014
- Re: [cgal-discuss] Nearest neighbor query in a Delaunay triangulation, Sylvain Pion, 02/11/2014
- Re: [cgal-discuss] Nearest neighbor query in a Delaunay triangulation, Andreas Fabri, 02/11/2014
- [cgal-discuss] Maximal distance of a set of points to another point, Cedric Doucet, 02/12/2014
- Re: [cgal-discuss] Nearest neighbor query in a Delaunay triangulation, Andreas Fabri, 02/11/2014
Archive powered by MHonArc 2.6.18.