Subject: CGAL users discussion list
List archive
- From: Camille Wormser <>
- To: <>
- Subject: Re: [cgal-discuss] Question on Triangulation
- Date: Wed, 2 Sep 2009 12:28:20 +0200
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
- [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.