Skip to Content.
Sympa Menu

cgal-discuss - Re: [cgal-discuss] Regular delaunay mesh refinement

Subject: CGAL users discussion list

List archive

Re: [cgal-discuss] Regular delaunay mesh refinement


Chronological Thread 
  • From: Daniel Oliveira <>
  • To:
  • Subject: Re: [cgal-discuss] Regular delaunay mesh refinement
  • Date: Sun, 2 May 2010 18:33:38 -0300
  • Domainkey-signature: a=rsa-sha1; c=nofws; d=gmail.com; s=gamma; h=mime-version:in-reply-to:references:date:message-id:subject:from:to :content-type; b=MCWaqKk9tXL8voYIVBY0cUNDoFVQPiy4w90PD/WtwWy2wHODKRGz87G66i71SpxT2I 1vFqEVrYKGJH/T9g/uH+Aw8aDuYTPuo1y2VxKQkGOQJ605mkeKv6cMpYroVK3iq7KM21 UXqod5VFQM8LV723TKxjjNGLpWZkmMFD8sWyY=

I'm using CGAL::Triangulation_vertex_base_with_info_2 and I need to update its information with natural neighbor coordinates as triangulation are refined, is possible to do that with cgal?

Thanks,

Daniel

2010/5/1 Laurent Rineau (GeometryFactory) <>
Le vendredi 30 avril 2010 21:15:52, Daniel Oliveira a écrit :
> Dear CGAL members,
>
> Is possible to do a mesh refinement on a regular 2D delaunay triangulation
> (i.e. CGAL::Delaunay_triangulation_2) ?

No. The CGAL 2D mesh generator¹ needs a bounded domain to work on. The
boundary of the domain must be given as constraints in a constrained Delaunay
triangulation. However, at the end of the meshing process, the constrained
Delaunay triangulation is guaranteed to be a conforming Delaunay
triangulation. In other words the constrained Delaunay triangulation is equal
to the Delaunay triangulation of its vertices. Maybe it is sufficient for your
needs.

¹) http://www.cgal.org/Pkg/Mesh_2

--
Laurent Rineau, PhD
Release Manager of the CGAL Project       http://www.cgal.org/
R&D Engineer at GeometryFactory           http://www.geometryfactory.com/

--
You are currently subscribed to cgal-discuss.
To unsubscribe or access the archives, go to
https://lists-sop.inria.fr/wws/info/cgal-discuss





Archive powered by MHonArc 2.6.16.

Top of Page