CGAL users discussion list

[Michael SCHINDLER <>]

Dear list,

I am rather new to CGAL, trying to use the weighted Delaunay and
periodic triangulations. At the moment, I have a technical question on
Union_find which I use to identify classes of triangulation vertices.

Once I have unified the sets in my Union_find instance, by
something like
  CGAL::Union_find<Vertex_handle> cls;
  CGAL::Unique_hash_map<Vertex_handle, typename 
CGAL::Union_find<Vertex_handle>::handle> cl_items(NULL);
  ... and then for some vertex handle vv0, vv1 ...
  cls.unify_sets(cls.find(cl_items[vv0]), cls.find(cl_items[vv1]));

I would like to iterate over all sets in cls, which can be done with
the iterator given Union_find::iterator. But how can I then iterate
over the members of such a set?

BTW: Is there a more elegant way to use unify_sets without the
search in a Unique_hash_map?

Thanks in advance for any advice,
Michael Schindler