Skip to Content.
Sympa Menu

cgal-discuss - Re: [cgal-discuss] 2D_Constrained_Delaunay_triangulation -

Subject: CGAL users discussion list

List archive

Re: [cgal-discuss] 2D_Constrained_Delaunay_triangulation -


Chronological Thread 
  • From: Camille Wormser <>
  • To:
  • Subject: Re: [cgal-discuss] 2D_Constrained_Delaunay_triangulation -
  • Date: Wed, 17 Sep 2008 11:20:25 +0200

-- 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 ?

Beware that inside triangles can have non user-defined boundary edges too.

The best would be to orient the boundary, and keep only the triangles which are on the left-handside (or right-handside...), by flooding the domain.

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.

You should distinguish triangulating and meshing: triangulating does just what I described. It is not always possible in 3D.

Meshing computes a mesh over a given domain (convex or not). This is what you want. See the Mesh generation part of the manual. The next release of CGAL will have a 3D mesh generation package as well.
--
Camille




Archive powered by MHonArc 2.6.16.

Top of Page