Subject: CGAL users discussion list
List archive
- From: Laurent Rineau <>
- To:
- Subject: Re: [cgal-discuss] triangulation boundary
- Date: Sat, 30 Dec 2006 23:28:41 +0100
- Organization: Inria, Sophia Antipolis, FRANCE
On Saturday 30 December 2006 16:14, Li Hongwei wrote:
> Hi,
>
>
>
> In triangulation_3, you may use
>
>
>
> std::list<Triangulation_3::Vertex_handle> boundary_vertices;
>
> t.incident_vertices(t.infinite_vertex(),std::back_inserter(boundary_vertice
>s ));
>
>
>
> 2D is similar while the signature of the incident_vertices() is a bit
> different.
In 2D, the vertices incident to a vertex are ordered. tr.incident_vertices(v)
is a circulator. See the documentation.
--
Laurent Rineau
INRIA - Sophia Antipolis
BP 93, 2004 Route des Lucioles
06902 Sophia Antipolis Cedex FRANCE
Phone: +33 4 92 38 71 54
- triangulation boundary, felator . vembloudu, 12/30/2006
- RE: [cgal-discuss] triangulation boundary, Li Hongwei, 12/30/2006
- Re: [cgal-discuss] triangulation boundary, Laurent Rineau, 12/30/2006
- RE: [cgal-discuss] triangulation boundary, Li Hongwei, 12/30/2006
Archive powered by MHonArc 2.6.16.