CGAL users discussion list

[Juan Carlos Lopez Alfonso <>]

Hi:

I have two questions related with a 3D triangulation using exclusively CGAL:

I have a List of Points (std::list<Point> L;;) with exactly 3278828
points and I have created a Triangulation using this constructor
(Triangulation T(L.begin(), L.end());) with the above mentioned list
of points. My first quation is, Why my triangulation have less points,
exactly 3261840 when I call this function (size_type vertices =
T.number_of_vertices();)? The second is related with the time of
computation, my triangulation delay 3.4 hours in a normal portatil, Is
it normal?

Best regards and waiting for any comments or answers
Juan Carlos