CGAL users discussion list

[Manuel Caroli <>]

Hi Yao,

yao oldbig wrote:
> 
> Is there anything like "edge iterator"? It looks more convenient in this 
> case by visiting edges in turn, because one edge corresponds to two 
> vertices.
Yes:
http://www.cgal.org/Manual/3.3/doc_html/cgal_manual/TriangulationDS_3_ref/Concept_TriangulationDataStructure_3.html#Nested_type_Edge_iterator
Note that in the triangulation data structure edges are not stored as
point pairs. They are represented as a triple consisting of a cell and
to integers determining two vertices in this cell. This determines the
edge between the two vertices and you can extract the points from the
vertices.

For a better understanding of the data structure please read
http://www.cgal.org/Manual/3.3/doc_html/cgal_manual/TriangulationDS_3/Chapter_main.html

best

Manuel