CGAL users discussion list

["Sebastien Loriot (GeometryFactory)" <>]

On 10/10/2014 02:20 PM, Pranav wrote:
> Hi,
>
> I have a linear cell complex *X*, and 3D Delaunay triangulation(say *D*) of
> the points(0-cell attribute) in *X*. I want to define a mapping between
> points in *X* and *D* using which I can get handle to the vertex in *X* for
> the corresponding point in *D*.
>
> I have seen the *Linear_cell_complex.h* and
> *Linear_cell_complex_operations.h* but I do not find a /locate()/ sort of
> function which can be used to get handle to the nearest point in *X* for a
> query point(which I thought of taking from *D*).
>
> I would like to know the ways in which this can be done.

Could you reformulate your question? It is not clear to me what you'd
like to do (I understand you want to do nearest neighbor queries but
I don't see why it is related to Delaunay triangulation and Linear cell 
complex)

Sebastien.

> -----
> Thanks in advance,
> Pranav
> --
> View this message in context: 
> http://cgal-discuss.949826.n4.nabble.com/Correspondence-between-points-in-CGAL-Delaunay-triangulation-3-and-CGAL-Linear-cell-complex-tp4659935.html
> Sent from the cgal-discuss mailing list archive at Nabble.com.