CGAL users discussion list

["Sebastien Loriot (GeometryFactory)" <>]

annie wrote:
> Thank you for response.
>
> If I am correct, your code gives me only sites (points or segments), not
> proper points of Delaunay triangulation graph. I will give a short example -
> according to http://www.lmia.uha.fr/~mage/brevilliers/2008_ewcg_slides.pdf
> on the slide 3 I see two points on segment S2 which belong to
> triangulations. They're not endpoints of segment or points of Voronoi
> diagram.
OK, from what I understand, the points you are looking for
does not exists (a unique embedding can not be given).
The triangulation is simply a graph so only the topology is encoded by
the data structure in CGAL.

If you do need a point, you can take one on the segment (but it may not
be well suited for your application).

S.

> I have already read documentation, but still I'm confused how to get what I
> need.
> Your help is inestimable for me;)
>
> annie