CGAL users discussion list

["Sebastien Loriot (GeometryFactory)" <>]

Hello George,

First look at the first example here:
http://www.cgal.org/Manual/latest/doc_html/cgal_manual/Triangulation_3/Chapter_main.html#Subsection_37.5.2
and replace color by an integer type and set to each vertex an index.

Then use
Finite_edges_iterator     t.finite_edges_begin()
Finite_edges_iterator     t.finite_edges_end()

to iterator over all finite edges of the triangulation.

Remember that as documented here:
http://www.cgal.org/Manual/latest/doc_html/cgal_manual/TriangulationDS_3_ref/Concept_TriangulationDataStructure_3.html

an edge in a 3D triangulation is of type Triple<Cell_handle, int, int>,
(c,i,j) is the edge of cell c whose vertices indices are i and j.

so if eit is an iterator over edges,
eit->first->vertex(eit->second)->info() and
eit->first->vertex(eit->third)->info() will give you the indices
of the two vertices of an edge.

S.

GGeorge wrote:
> Hello Mariette,
>
> I want to use CGAL to make a 3D-Delauny-Triangulation for Tecplot (Tecplot
> seems to be suited only for 2D).
> I started from the example triangulation_prog1.cpp and
> triangulation_prog1.cin :
> 1 0
> 3 2
> 4 5
> 9 8
> 7 4
> 5 2
> 6 3
> 10 1
>
> Tecplot needs a connectivity list which is based on the line number / order
> of the points given:
>  1 8 6
>  3 1 2
>  3 5 4
>  8 4 5
>  6 2 1
>  3 7 5
>  7 3 6
>  7 8 5
>  6 8 7
>
> I started with something like that:
> for(Finite_faces_iterator fc = t.finite_faces_begin() ; fc !=
> t.finite_faces_end(); ++fc) but the CGAL concept / datastructures are still
> quite confusing me to me :(
>
> Is CGAL a good tool to create something like that?
> What data-structures / methods of CGAL are helpful for that?
> Thank you for your help and for CGAL!
>
> George
>
>
> --
> View this message in context: 
> http://cgal-discuss.949826.n4.nabble.com/Beginner-Delauny-Triangulation-in-Tecplot-Format-tp3403062p3403062.html
> Sent from the cgal-discuss mailing list archive at Nabble.com.