CGAL users discussion list

["Sebastien Loriot (GeometryFactory)" <>]

The edge type is define in the TDS_2 doc page [0]


typedef std::pair<Face_handle,int>  Edge;
The edge type. The Edge(f,i) is edge common to faces f and 
f.neighbor(i). It is also the edge joining the vertices vertex(cw(i)) 
and vertex(ccw(i)) of f.

So if you have an edge e,
e.first and e.first.neighbor( e.second ) are the two incident
facets.


Sebastien.


[0] 
http://www.cgal.org/Manual/latest/doc_html/cgal_manual/TDS_2_ref/Concept_TriangulationDataStructure_2.html#Cross_link_anchor_1355


On 08/28/2012 04:38 AM, Wang Hetao wrote:
> Hello everyone, I'm a new comer here, so nice to meet you.
> Now a question to ask. I'm doing some experiments using Delaunay by checking
> quadrangles formed by two adjacent triangles. Iterating every face will lead
> to repeated computation, Iterating every edge will not. CGAL has provided
> functionality to iterate over all finite edges:
> Triangulation::finite_edges_begin() and Triangulation::finite_edges_end().
> I'm wondering whether I can find two faces incident to a edge in Delaunay
> Triangulation, or just "Triangulation" as the same.
> Thanks for your reply
>
>
>
> --
> View this message in context: 
> http://cgal-discuss.949826.n4.nabble.com/How-to-get-two-faces-incident-to-a-edge-in-Delaunay-Triangulation-tp4655759.html
> Sent from the cgal-discuss mailing list archive at Nabble.com.