Skip to Content.
Sympa Menu

cgal-discuss - Re: [cgal-discuss] Question on Triangulation

Subject: CGAL users discussion list

List archive

Re: [cgal-discuss] Question on Triangulation


Chronological Thread 
  • From: Rahul Kavalapara <>
  • To:
  • Subject: Re: [cgal-discuss] Question on Triangulation
  • Date: Wed, 2 Sep 2009 04:56:29 -0600

Thanks Camille !

I have checked "colored_face.cpp" example which uses the iterator finite_face_begin and finite_face_end.
The program does not output anything to me ? Am I missing something ?

--

Rahul

On Wed, Sep 2, 2009 at 4:28 AM, Camille Wormser <> wrote:
It outputs the incident vertices. I find this unclear, of which vertex is incident to the actual vertex.

Hi,
In fact, the call


 Vertex_circulator vc = t.incident_vertices(t.infinite_vertex()),

gets the circulator of points incidents to the infinite vertex (i.e., the points that are on the convex hull of your set of points).


Can we output the triangulation in the form of triangles ?


You can access the list of all triangles of your triangulation (I assume you are considering a 2D triangulation) by using the iterators returned by

finite_faces_begin()
finite_faces_end()

--
Camille

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




Archive powered by MHonArc 2.6.16.

Top of Page