Hi,

first of sorry for asking a question which is even covered in the CGAL-faq, but

I cant find any info on the following:

My question is about triangulating the interior of a polygon. I use the

constrained triangulation to get the triangulation of the convex hull with the

edges of the polygons as constrained edges.

How do I detect those faces which are inside/outside the area of the polygon?

All I can think of is to check for each vertex of each face whether it is

possible to

reach the infinity vertex without crossing any constrained edge. But this

approach

looks quite awkward to me. Can somebody give me a hint how to do it ?

Thank you very much in advance,

David

--

You are currently subscribed to cgal-discuss.

To unsubscribe or access the archives, go to

https://lists-sop.inria.fr/wws/info/cgal-discuss