CGAL users discussion list

[Thijs van Lankveld <>]

I would use a constrained triangulation for such a task (with the 
polygon edges as constraints). All the convex parts would then be triangles.

Thijs


On 04/12/2013 20:38, Asher Kamiraze wrote:
> Hi all,
>
> I am looking for an implementation of an algorithm to decompose a 
> simple polygon in convex parts. I am not looking for an optimal solution.
>
> If anyone has some clues or code he his willing to share...
>
> Regards,
>
> Asher