CGAL users discussion list

["Sebastien Loriot (GeometryFactory)" <>]

I understood that you were only interested in the unbounded face.
But if you iterator over all the faces of the arrangement you can also 
get bounded faces.

Something like:

  Face_const_iterator fit;
  std::cout << arr.number_of_faces() << " faces:" << std::endl;
  for (fit = arr.faces_begin(); fit != arr.faces_end(); ++fit)
  {

  }

Sebastien.

On 06/13/2018 05:06 AM, Anne wrote:
> Is there anyway to extract the vertices (in order clockwise or counter
> clockwise) for each of the holes (cells)? I have tried the code with five
> segments (as given in the code sample) and it just produce only one hole (As
> I imagine, it should produce ~ 7 holes in total).
>
> For example, I insert an image here for better explanation about my problem,
> could you suggest the way to get the vertices & edges for each bounded faces
> (e.g., F1, F2,F3,F4) which formed by intersecting the line Segments (1, 2,
> ...,6)
> Thank you.
> <http://cgal-discuss.949826.n4.nabble.com/file/t375966/cell_decomposition.jpg>
>
>
>
> --
> Sent from: http://cgal-discuss.949826.n4.nabble.com/