Subject: CGAL users discussion list
List archive
- From: Sylvain Pion <>
- To:
- Subject: Re: [cgal-discuss] Location query outside convex hull of Delaunay_3
- Date: Sun, 18 Oct 2009 22:37:17 +0200
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/
- [cgal-discuss] Location query outside convex hull of Delaunay_3, Sybren A . Stüvel, 10/18/2009
- Re: [cgal-discuss] Location query outside convex hull of Delaunay_3, Sylvain Pion, 10/18/2009
- Re: [cgal-discuss] Location query outside convex hull of Delaunay_3, Sybren A . Stüvel, 10/18/2009
- Re: [cgal-discuss] Location query outside convex hull of Delaunay_3, Sylvain Pion, 10/18/2009
Archive powered by MHonArc 2.6.16.