CGAL users discussion list

Hi Matthieu

> I would like to have some information about the edge in the 
> triangulation_3: I would like to use an edge iterator and retrieve the 
> handle of the two vertices which constitute the edge. But I have the 
> impression that it is not possible..

yes it is possible. see 
http://www.cgal.org/Manual/3.2/doc_html/cgal_manual/TriangulationDS_3_ref/Concept_TriangulationDataStructure_3.html

typedef Triple<Cell_handle, int, int> Edge;

If the edge is (c,i,j) then the two vertex handles are c->vertex(i) and 
c->vertex(j).

> So, I would like to use an edge 
> circulator in 3D: I saw that in the triangulation_3 I can use an edge 
> iterator but I would prefer an edge circulator like in triangulation_2: 
> tds.incident_edges(vertex_handle). With an edge circulator I can have 
> some information about the handle of 1 vertex which constitute the edge 
> (it is better than nothing..). So, If somebody have an idea to help me 
> it will be great!!

In 2D, having an edge circulator is natural and meaningful: edges are 
ordered around a vertex. In 3D edges are not circularly ordered around a 
vertex.

see again
http://www.cgal.org/Manual/3.2/doc_html/cgal_manual/TriangulationDS_3_ref/Concept_TriangulationDataStructure_3.html

template <class OutputIterator>
OutputIterator  
tds.incident_vertices ( Vertex_handle v, OutputIterator vertices)
                Copies the Vertex_handles of all vertices incident
                to v to the output iterator vertices.

best,
        Monique Teillaud