Skip to Content.
Sympa Menu

cgal-discuss - Re: [cgal-discuss] Problems with a 3D Triangulation

Subject: CGAL users discussion list

List archive

Re: [cgal-discuss] Problems with a 3D Triangulation


Chronological Thread 
  • From: Monique Teillaud <>
  • To:
  • Subject: Re: [cgal-discuss] Problems with a 3D Triangulation
  • Date: Tue, 25 Oct 2011 13:16:09 +0200

Dear Juan Carlos

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();)?

my guess is that you have identical points in your set

The second is related with the time of
computation, my triangulation delay 3.4 hours in a normal portatil, Is
it normal?

The following section of the manual will give you hints about expected running times (~ 10 seconds for 1 million points)
http://www.cgal.org/Manual/latest/doc_html/cgal_manual/Triangulation_3/Chapter_main.html#Subsection_38.6.1

With more than 3 million points, you might encounter problems with memory and swap, depending on your computer.

Best regards,
--
Monique Teillaud
INRIA Sophia Antipolis - Méditerranée
http://www.inria.fr/sophia/members/Monique.Teillaud/



Archive powered by MHonArc 2.6.16.

Top of Page