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: Josef Weinbub <>
  • To:
  • Subject: Re: [cgal-discuss] 2D_Constrained_Delaunay_triangulation -
  • Date: Wed, 17 Sep 2008 11:29:14 +0200
  • Domainkey-signature: a=rsa-sha1; c=nofws; d=gmail.com; s=gamma; h=subject:from:to:in-reply-to:references:content-type:date:message-id :mime-version:x-mailer:content-transfer-encoding; b=NROnmrb+y2K6ZVaIEQ1NwaqHN4FT4lHoiJ2//7LKPdbYECW/81xV1lnWXpvKWNx4pM V7HkDM9i9Crmqhjitk9KPfAiWKMGnl6poxGRgsK/B/sBdrF/a2MFLhWoE0+6r14lzXwJ 3aEwoofqAvEg8VVETRQMNX70iPN/QNzkhtr18=

Got it, thank your very much.

wishes,
Josef

On Wed, 2008-09-17 at 11:20 +0200, Camille Wormser wrote:
> > -- 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