CGAL users discussion list

["Christian Friedrich" <>]

Thanks again, the manual made me believe otherwise but it works like a charm. I'm surprised that even though it seems to iterate over all edges of all cells, there are no double edges returned.
Well as long as it works ;)

Cheers,
Christian

On Feb 19, 2008 11:40 AM, Daniel Duque Campayo <> wrote:

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

--
You are currently subscribed to cgal-discuss.
To unsubscribe or access the archives, go to
https://lists-sop.inria.fr/wws/info/cgal-discuss

-- 
Best Regards,

Christian Friedrich MSc ing 
Phd candidate

Technische Universiteit Delft
Hyperbody
www.hyperbody.bk.tudelft.nl
Berlageweg 1
2628 CR Delft
kab. 1.37

T: +31 (0)15 27 85954
M: +31 (0)6 16 43 1661
E: