CGAL users discussion list

["Sebastien Loriot (GeometryFactory)" <>]

horstmann wrote:
> Thank you for the fast answer, 
>
> but I still don't know how to iterate over the resulting triangles, and how
> to get the indexes of the vertices of each triangles. As I said before, I
> need something like that:
>
> triangle_1 v1 v2 v3
> triangle_2 v1 v3 v4
> triangle_3 v2 v4 v5
> ......
>
> and so on. (At the moment, I'm not interested in the vertices x,y,z
> coordinates, but its indexes)
>
> Thank you again in advance.
>
> --
> View this message in context: 
> http://cgal-discuss.949826.n4.nabble.com/Help-getting-triangles-coordinates-from-Delaunay-Triangulation-tp3955310p3955454.html
> Sent from the cgal-discuss mailing list archive at Nabble.com.

Look at these examples to associate an integer to vertices of the 
triangulation:

http://www.cgal.org/Manual/latest/doc_html/cgal_manual/Triangulation_3/Chapter_main.html

Then instead of calling
it->first->vertex( (it->second+k)%4 )->point()
do
it->first->vertex( (it->second+k)%4 )->info()

To get convex hull facets, use
t.incident_cells (t.infinite_vertex(),OutputIterator) const
here:
http://www.cgal.org/Manual/latest/doc_html/cgal_manual/Triangulation_3_ref/Class_Triangulation_3.html#Cross_link_anchor_1344

The index of the infinite vertex is given using the function index of 
Cell like this: cell_handle->index(t.infinite_vertex())
documentation is here:
http://www.cgal.org/Manual/latest/doc_html/cgal_manual/TriangulationDS_3_ref/Concept_TriangulationDataStructure_3--Cell.html


Sebastien.