CGAL users discussion list

[Daniel Duque Campayo <>]

On Tuesday 19 February 2008 11:32:50 

 wrote:
> And, another question:
>
> Is is possible to get a list of all Edges of the Delaunay Triangulation?
> I saw in the manual that there are only Vertices and Cells stored in the
> Triangulation, but maybe there is a smart way of iterating through all
> Edges?

There is an edge iterator:

typedef Triangulation::Edge_iterator  Edge_iterator;

for ( F_edges_iterator ed = T.finite_edges_begin();
            ed !=T.finite_edges_end(); ++ed) {
  ...
}

See, e.g.:

http://www.cgal.org/Manual/3.3/doc_html/cgal_manual/TriangulationDS_3_ref/Concept_TriangulationDataStructure_3.html

Best,

Daniel

-- 
Daniel Duque
http://rincon.uam.es/dir?cw=950067138671875