CGAL users discussion list

[Mariette Yvinec <>]

A good way to triangulate a polygon,
either with holes or not,
is to use a constrained Delaunay triangulation.
This yields a Triangulation filling the whole convex hull of the vertices
but where faces that are inside the polgons can be marked.

Remi wrote:
> I have an instance of Polygon_with_holes_2. First I call
> connect_holes(..) to get rid of the holes and then I call
> optimal_convex_partition_2(..) with the list of vertices
> connect_holes(..) gave me.
> But the precondition check in optimal_convex_partition_2(..) fails. It
> says that the list of input vertices doesn't represent a simple
> polygon! (is_simple_2(..) returns false). Isn't connect_holes(..)
> supposed to produce a simple polygon?
> Is optimal_convex_partition_2(..) the best way to triangulate
> polygons, especially polygons with holes?
> I'm a beginner so any input is appreciated.
>
>   

--
Mariette Yvinec
Geometrica project team
INRIA  Sophia-Antipolis