Subject: CGAL users discussion list
List archive
- 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:
Hi,It outputs the incident vertices. I find this unclear, of which vertex is incident to the actual vertex.
In fact, the callgets the circulator of points incidents to the infinite vertex (i.e., the points that are on the convex hull of your set of points).
Vertex_circulator vc = t.incident_vertices(t.infinite_vertex()),
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
Can we output the triangulation in the form of triangles ?
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
- [cgal-discuss] Question on Triangulation, Rahul Kavalapara, 09/02/2009
- Re: [cgal-discuss] Question on Triangulation, Camille Wormser, 09/02/2009
- Re: [cgal-discuss] Question on Triangulation, Rahul Kavalapara, 09/02/2009
- <Possible follow-up(s)>
- [cgal-discuss] Question on Triangulation, Rahul Kavalapara, 09/10/2009
- Re: [cgal-discuss] Question on Triangulation, Matthew Denno, 09/10/2009
- Re: [cgal-discuss] Question on Triangulation, Andreas Fabri, 09/10/2009
- Re: [cgal-discuss] Question on Triangulation, Rahul Kavalapara, 09/10/2009
- Re: [cgal-discuss] Question on Triangulation, Andreas Fabri, 09/10/2009
- Re: [cgal-discuss] Question on Triangulation, Rahul Kavalapara, 09/10/2009
- Re: [cgal-discuss] Question on Triangulation, Camille Wormser, 09/02/2009
Archive powered by MHonArc 2.6.16.