CGAL users discussion list

[Mariette Yvinec <>]

No, CGAL triangulations always cover the convex hull of the vertices.


Stephen Wong wrote:

Hello,

 

I have looked at using CGAL for performing triangulation of certain polygons.  They are:

1.       Non-convex polygons where the convex hull(polygon) != polygon

2.       Polygons with an inner hole, i.e. donut polygons.

 

The edges of the polygons are constraints in a Constrained-triangulation.  Is there a convenient way to simply triangulate these kind of polygons, without manually having to remove facets inside the inner hole and/or facets outside the polygon but inside the convex hull?

 

Thank you again,

 

Stephen

 

-- 
Mariette Yvinec
Geometrica project team
INRIA  Sophia-Antipolis