CGAL users discussion list

["Sebastien Loriot (GeometryFactory)" <>]

On 04/14/2011 05:32 AM, sara123 wrote:
> After reading the cgal manual (2D Triangulations) I realized that after
> constrained triangulation of a simple polygon we have eventually a convex
> polygon, even if our input polygon does'nt be convex!

Of course, it is computing a triangulation of the plane.
You have to filter out triangles that are outside you original polygon.

You can use a propagation from triangles to triangles, never crossing a
constrained edge. The simplest is to start with an infinite face and
get all faces that are not in the polygon.

S.



> what should i do if i want this does'nt happen?
>
>
> --
> View this message in context: 
> http://cgal-discuss.949826.n4.nabble.com/polygon-triangulation-tp3356157p3448688.html
> Sent from the cgal-discuss mailing list archive at Nabble.com.