CGAL users discussion list

[Simon Giraudot <>]

Hello,

I am trying to access the nearest simplex (vertex, edge or facet) of a 
query point lying *outside* of the convex hull of the 3D Delaunay 
triangulation (this nearest simplex is thus adjacent to at least one 
infinite cell).

It seems difficult for several reasons:
* The infinite cells of a DT do not have a geometric meaning: locate() 
applied to an outside point returns "one" infinite cell, but it does not 
means that the point projects on the finite facet of this cell;
* The nearest_vertex() can give a hint but the nearest vertex of an 
outside point is not necesseraly on the convex hull.

Is there a simple/efficient way to do that?

Thanks in advance,

--
Simon Giraudot, PhD
R&D Engineer
GeometryFactory - http://geometryfactory.com/