CGAL users discussion list

["Sebastien Loriot (GeometryFactory)" <>]

Kostis wrote:
> I have one more question that is related with polygon partitioning.
> In some cases, I have non-simple polygons that need to be partitioned. 
> Since all the partitioning algorithms require a simple polygon, is there a
> way to convert a non-simple polygon to a union of simple polygons?
1) you can use the arrangement package:
make an arrangement of the segment and use the result to get simple 
polygons.

2) a constrained triangulation with intersecting constraints can 
probably do the job as well


S.