CGAL users discussion list

[Adam Hopkins <>]

Hi all,

 

Thank you for your previous answers, but I have a last issue related with triangulations.

Using the example code below, I can know which are the external cells of a triangulations, but I also need to know which are the external vertex of the same triangulation. Is there any form to know which are the external facets of each of these cells in order to know which are the most external vertexes of this triangulation?

Concretely, How Can I know which are the external vertices of a triangulation?

std::vector<Cell_handle> infinite_cells;

T.incident_cells(T.infinite_vertex(), std::back_inserter(infinite_cells));

for(int ii = 0; ii < (int)infinite_cells.size(); ii++)

{

Cell_handle c = infinite_cells[ii];

Cell_handle e = c->neighbor(c->index(T.infinite_vertex()));

}

Regards and thank you for all

A.