CGAL users discussion list

[Ungermann, Jörn <>]

Hello!

I am using a Delaunay triangulation for some interpolation on an irregular
2D grid.
Some points however do not lie within the convex hull. I'd like to use the
value of the nearest point within the convex hull for those.

I found nearest_vertex() and currently use that to circulate with
incident_faces() though all adjacent faces of that nearest vertex to
assemble all
neighbouring vertices in a std::set and then do some projections to find
out, whether the closest point is on the edge between the nearest and a
neighbouring vertex or if it is the nearest vertex itself.

This takes several dozens line of (currently not terribly efficient) code
for something, which I think might be contained somewhere in the library.

So, is there a function, which calculates for a given point the nearest
point from within the convex hull of a triangulation?

Thanks and kind regards,
Jörn Ungermann

--
Dr. Joern Ungermann
Institute of Energy and Climate Research - Stratosphere (IEK-7)
Research Centre Juelich
Telefon: +49 2461 61-6438

Attachment: smime.p7s
Description: S/MIME cryptographic signature