CGAL users discussion list

[Olumide <>]

Hello -

I've got another novice question. As some of you may know, I am very new 
to CGAL and to computational geometry. So please bear with me.

I've been taking a close look at the Triangulation_2 class, with a view 
to representing an existing triangulation in CGAL, and performing 
certain computations on the triangulation. However, I have just realized 
that the class Triangulation_2, appears to construct a triangulation 
from a planar subset (I'm referring to page 185 of Computational 
Geoemtry by M. de Berg et. al.) rather than represent an existing 
triangulation.

First of all, I'd like to confirm if this is the case, and if so, how 
may an *existing* triangulation may encoded (I'm not sure of this is the 
appropriate term) in CGAL. The Constrained Delaunay triangulation/mesh 
looks promising, but I'm still guessing, so I'd like someone to please 
correct me if I'm wrong.

Lastly, I'd like to know if a mesh (I suppose that's what I'll be using) 
can be converted into a Triangulation_2. I'd like to know because as I'd 
like to perform certain computations on my triangulation.

Thank you,

- Olumide