CGAL users discussion list

[Benoît Presles <>]

Hello everybody,

By executing the "ex_alpha_shapes_2.cpp" file provided with CGAL, I get 
at the end of the process a list of segments which are the edges of the 
alpha shape (GENERAL MODE).
I represent this result as the adjacency matrix of an undirected graph 
(each point is a node and each segment is an edge).
Is there a fast way (I work with 100 000 points minimum) using CGAL to 
find the cycles of this graph (closed polygons) ?


Thank you very much for your help,
Best Regards,
Ben_P