CGAL users discussion list

["Sebastien Loriot (GeometryFactory)" <>]

This is due to the infinite vertex.

Have a look at this paragraph:

http://www.cgal.org/Manual/latest/doc_html/cgal_manual/Triangulation_2/Chapter_main.html#Section_35.2


Sebastien.

hmichon wrote:
> Hi,
>
> I am a beginner in cgal and I cannot understand how the numbering of points
> is done.
> When I write std::cout << cdt << std::endl, with cdt being a constrained
> Delaunay triangulation, I always obtain one more point than my triangulation
> actually shows on a figure.
> And what is more, there are more triangles than on my figure too, with the
> extra point in them.
>
> For example, a figure with only three points, and the three segments as
> constrained edges, the answer I get is
>
> 4 4 2
> 1 0
> -0.499658 0.866223
> -0.500684 -0.86563
>
> 2 0 3
> 1 2 3
> 0 1 3
> 2 1 0
>
> 2 1 3
> 0 2 3
> 1 0 3
> 2 0 1
> N C N
> C C C
> C N N
> N N C
>
>
> How is that ? and what is in the third paragraph ?
> Thank you very much
>
> Hélène
>
>
> --
> View this message in context: 
> http://cgal-discuss.949826.n4.nabble.com/point-numbering-in-a-Delaunay-constrained-triangulation-tp3582020p3582020.html
> Sent from the cgal-discuss mailing list archive at Nabble.com.