CGAL users discussion list

[Sylvain Pion <>]

Sybren A. Stüvel a écrit :
> I've got a Delaunay_3 triangulation and I'm performing location
> queries on it. When I get a cell (p, q, r, infinity) because the query
> point lies outside the convex hull, are p, q and r guaranteed to be
> the nearest neighbours of my query point?

There is no such guarantee.
The only guarantee is that the plane (p,q,r) separates your query point
from the rest of the triangulation.  Maybe have a look at nearest_vertex() ?

--
Sylvain Pion
INRIA Sophia-Antipolis
Geometrica Project-Team
CGAL, http://cgal.org/