Subject: CGAL users discussion list
List archive
- From: Rahul Kavalapara <>
- To:
- Subject: [cgal-discuss] Question on Triangulation
- Date: Wed, 2 Sep 2009 04:14:59 -0600
Hi,
From the triangulation example "triangulation_prog1.cpp", given in the documentation.
Triangulation t;
t.insert(begin, end);
Vertex_circulator vc = t.incident_vertices(t.infinite_vertex()),
done(vc);
if (vc != 0) {
do { std::cout << vc->point() << std::endl;
}while(++vc != done);
}
It outputs the incident vertices. I find this unclear, of which vertex is incident to the actual vertex.
Can we output the triangulation in the form of triangles ?
like triangle:(10,3),(4,5),(8,7) as it is much clear which are the vertices forming the triangles ?
--
Rahul
- [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.