Skip to Content.
Sympa Menu

cgal-discuss - Re: [cgal-discuss] CGAL question about extracting vertex list

Subject: CGAL users discussion list

List archive

Re: [cgal-discuss] CGAL question about extracting vertex list


Chronological Thread 
  • From: "Laurent Rineau (GeometryFactory)" <>
  • To:
  • Subject: Re: [cgal-discuss] CGAL question about extracting vertex list
  • Date: Mon, 3 Oct 2011 19:08:39 +0200
  • Organization: GeometryFactory

On lundi 03 octobre 2011 18:59:51 Karen Daniels wrote:
> Thanks.
>
> Also, I see how to iterate over the vertices in a face of a
> triangulation, but what if I want to iterate over all the vertices in
> the entire triangulation (without explicitly navigating each face)?

In the class template Triangulation_3, which is the base of all 3D
triangulations in CGAL, you have the iterator type
"Finite_vertices_iterator",
and the methods "finite_vertices_begin()" and "finite_vertices_end()".

If you want to iterate over all vertices, including the infinite vertex,
there
are "All_vertices_iterator" and the corresponding iterator methods.

In the 2D triangulations you can find similar iterator types and methods.


See the documentation pages for 2D and 3D:
http://www.cgal.org/Manual/latest/doc_html/cgal_manual/Triangulation_2_ref/Class_Triangulation_2.html
http://www.cgal.org/Manual/latest/doc_html/cgal_manual/Triangulation_3_ref/Class_Triangulation_3.html

--
Laurent Rineau, PhD
R&D Engineer at GeometryFactory http://www.geometryfactory.com/
Release Manager of the CGAL Project http://www.cgal.org/



Archive powered by MHonArc 2.6.16.

Top of Page