Skip to Content.
Sympa Menu

cgal-discuss - Re:[cgal-discuss] Edge Iterators

Subject: CGAL users discussion list

List archive

Re:[cgal-discuss] Edge Iterators


Chronological Thread 
  • From: "Thomas Zangl - Home" <>
  • To: "cgal-discuss" <>
  • Subject: Re:[cgal-discuss] Edge Iterators
  • Date: Sun, 12 Aug 2007 10:45:15 +0200


Am Sun, 12 Aug 2007 01:35:24 -0700, schrieb "Andreas Fabri"

Hi!

I have also 2cents for this topic. Let's consider I am interested in
CGAL's Triangulation_3, I type in the Google Toolbar:

"cgal triangulation_3" which leads me to
http://www.cgal.org/Manual/3.3/doc_html/cgal_manual/Triangulation_3_ref/Class_Triangulation_3.html

as the first hit. I then want to know how to iterate over all edges:

Finite_edges_iterator t.finite_edges_begin () Starts at an
arbitrary finite edge. Then ++ and -- will iterate over finite edges. Returns
finite_edges_end() when t.dimension() <1.

With a bit of searching through the page, I can see that:
Triangulation_3<TriangulationTraits_3,TriangulationDataStructure_3>::Finite_edges_iterator
iterator over finite edges

Now I am stuck. What's the type of a Finite_edges_iterator? Whats the
type of e.g: typedef TriangulationDataStructure_3::Edge Edge; ?

I was able to lookup their types myself when I greped through the CGAL
source code.

Best regards,
--
----------------------------------------------------------------
,yours Thomas Zangl, Bakk.rer.soc.oec. -

-
- Freelancer - IT Consulting & Software Development -
- Student of Software Development-Economy (Master) -



Archive powered by MHonArc 2.6.16.

Top of Page