CGAL users discussion list

["Sebastien Loriot (GeometryFactory)" <>]

 wrote:
> Hi everyone, I now have a problem as follows:
> I have two rings of vertices (halfedges) with different degrees (number of
> edges), each ring can be seen as a hole, which means the halfedges on each 
> ring
> are border edges. Now i want to merge the two rings with some algorithm, how 
> to
> use the functions in  Polyhedron_3, for example split_edge,join_facet..., to
> connect the vertices on the two rings one by one, in order to finish this task
> please?
Have you tried splitting some edges in the loop having the less boundary
halfedges (see split_vertex and split_edge)?

http://www.cgal.org/Manual/latest/doc_html/cgal_manual/Polyhedron_ref/Class_Polyhedron_3.html




> Actually, this problem can be explained as: how to do the "join_loop" 
> operation
> in Polyhedron_3 when the degrees of the two facets are different? I know the
> rule of how to connect the vertices on the two rings gradually, and just don't
> know how to do it through the functions provided in Polyhedron_3, since the 
> two
> rings are diconnected to each other at first.
>
> Meanwhile, I just want to use the operations in Polyhedron_3 without 
> rebuilding
> the whole mesh using the "delegate " method or Nef_polyhedron.
>
> Could you please help me? Thanks!