CGAL users discussion list

[Juan Carlos Lopez Alfonso <>]

Hi:

Thank you for your answer. About my second question about the
computing time, you say that the problem would be my memory, but could
you tell me any suggestion about how I can obtain better performance?
I am using CGAL 3.9 with visual studio 2010, in a Pentium(R) Dual-Core
CPU 2.10 GHz and 2GB RAM. On the other hand, I have the maximum value
(8190 MB) of virtual memory in my windows 7 option.

Best regards from Madrid and thank you again
Juan Carlos

On Tue, Oct 25, 2011 at 1:16 PM, Monique Teillaud
<>
 wrote:
> 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/
>
> --
> You are currently subscribed to cgal-discuss.
> To unsubscribe or access the archives, go to
> https://lists-sop.inria.fr/wws/info/cgal-discuss
>
>