Skip to Content.
Sympa Menu

cgal-discuss - Re: [cgal-discuss] Constrained Delaunay Triangulation, finding edges in polygons

Subject: CGAL users discussion list

List archive

Re: [cgal-discuss] Constrained Delaunay Triangulation, finding edges in polygons


Chronological Thread 
  • From: Michael Hoffmann <>
  • To: <>
  • Subject: Re: [cgal-discuss] Constrained Delaunay Triangulation, finding edges in polygons
  • Date: Sun, 29 Sep 2013 08:45:54 +0200

If you label the vertices of your constrained polygons by component/polygon
(i.e., the first by 1, the second by 2, etc.), you can just iterate over the
edges of the triangulation and select those whose endpoints have the same
label.

It sounds like you know those polygons because they are part of your input.
If not, you might have to compute them via BFS/DFS or so.
For the labels you can use the vertex_with_info classes.

hth, Michael


Archive powered by MHonArc 2.6.18.

Top of Page