Skip to Content.
Sympa Menu

cgal-discuss - Re: [cgal-discuss] How to create a constrained delaunay triangulation from a list of triangles.

Subject: CGAL users discussion list

List archive

Re: [cgal-discuss] How to create a constrained delaunay triangulation from a list of triangles.


Chronological Thread 
  • From: "Laurent Rineau (GeometryFactory)" <>
  • To:
  • Subject: Re: [cgal-discuss] How to create a constrained delaunay triangulation from a list of triangles.
  • Date: Fri, 16 Oct 2009 15:05:27 +0200
  • Organization: GeometryFactory

On Friday 16 October 2009 14:34:50 Abel Alonso wrote:
> Hi everyone!
>
> I'm using the class Constrained_Delaunay_triangulation_2 to perform 2D
> triangulations on point clouds and to develop a mesh editor which is
> capable to flip triangles, remove triangles, divide triangles, remove
> vertexes, etc. Until today I was able to implement all stuff I need, but
> I'm stuck developing an mesh importer, right now. I want to create a
> triangulation by adding the faces directly, because this information is
> given by the file I'm importing the data from. I'm totally lost and I
> don't know how to do this. Is there any way to do it? Any idea?

It is not doable, mathematically.

A constrained Delaunay triangulation is defined only by its set of points,
and
the set of constraints (segments). Any set of triangles cannot be "imported"
into a constrained triangulation (but if you constrain all edges of the
triangulation).

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



Archive powered by MHonArc 2.6.16.

Top of Page