CGAL users discussion list

[Josef Weinbub <>]

hi

first of all thanks for your quick reply!
> 
> The CGAL 2D constrained triangulation always returns a triangulation  
> of the convex hull of the vertices, and the guarantee is that each  
> constraint segment appears as edge of the triangulation.
> 
ok, as a result I can only imagine one way to use the CGAL 2D
constrained triangulation (or any other meshing method of CGAL) to only
triangulate a given area with user defined boundaries(ie: my mentioned
non convex domain):
 -- post processing the mesh --

some kind of - "remove boundary triangles which insist of a
non-user-defined boundary edge" - post processing algorithm

am I right here, or do I miss another possibility ? 

> In your case, your constraints bound a non convex domain, so you  
> should expect this outer triangle.
tbh I didnt expect it, due to my previous experience with "triangle2D"
by J.R.Shewchuck and "tetgen", which is a 3d tetrahedron mesher, but
offers quite the same interface and behavior.
> -- 
> Camille
> 

thx for your time ..

regards,
Josef