Skip to Content.
Sympa Menu

cgal-discuss - Re: [cgal-discuss] help with CGAL conceptual

Subject: CGAL users discussion list

List archive

Re: [cgal-discuss] help with CGAL conceptual


Chronological Thread 
  • From: Camille Wormser <>
  • To:
  • Subject: Re: [cgal-discuss] help with CGAL conceptual
  • Date: Mon, 27 Oct 2008 23:07:37 +0100

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




Archive powered by MHonArc 2.6.16.

Top of Page