CGAL users discussion list

[Mariette Yvinec <>]

A popular solution to your problem is to store in each triangulation vertex
 the global index of the point corresponding to that vertex.
This is easily done using
 Triangulation_vertex_base_with_info as basis for the triangulation vertex class.
See examples in sections 5.6, 5.7 and 5.8 of the user manual.

Le 22/05/13 14:11, wallace a écrit :

Thanks for pointing that out. I'm finding my way around the documentation
better now.

Can you tell me if there's a straightforward way to return the "global
vertex indices" of tetrahedron in a Delaunay triangulation. I.e., if I make
a Delaunay triangulation, I can find the tetrahedron containing a point
using locate(). Then I can access the vertices via the cell handle and
return the point coordinates and LOCAL cell indices (1,2,3,4). It would also
be useful to return which point each vertex of a cell corresponds to in the
GLOBAL list of points that were inserted into the Delaunay triangulation.

In the attached file, I've written a short program that does what I want,
but I have to loop through the entire list of Delaunay points to find a
match to each cell vertex - surely there must be a more efficient way? Have
I overlooked a simple access function?

delaunay_cell_finder.cpp
<http://cgal-discuss.949826.n4.nabble.com/file/n4657556/delaunay_cell_finder.cpp>  



--
View this message in context: http://cgal-discuss.949826.n4.nabble.com/Tetrahedral-mesh-point-location-tp4655387p4657556.html
Sent from the cgal-discuss mailing list archive at Nabble.com.

-- 
Mariette Yvinec
Geometrica project team
INRIA  Sophia-Antipolis