CGAL users discussion list

[Camille Wormser <>]

> Edges aren't really stored in Triangulation data structure still can  
> be
> accessed threw handlers, iterators and circulators.
> Still have a question: How do I create/get edge_handler from a facet?

Here is what the Triangulation_data_structure_3 manual says:

> typedef Triple<Cell_handle, int, int>     Edge;
> (c,i,j) is the edge of cell c whose vertices indices are i and j.  
> (See Section 28.1.)
>
> typedef std::pair<Cell_handle, int>     Facet;
> (c,i) is the facet of c opposite to the vertex of index i. (See  
> Section 28.1.)


In your code, you would access the Cell_handle and the index from the  
Facet_iterator facet by doing

Cell_handle c = facet->first;
int index = facet->second;

--
Camille