CGAL users discussion list

["Bakker, Martein" <>]

I have tried the lazy_exact gmpq number system and have some improvement. 
Creation of Polyhedron_3 and conversion to Nef_Polyhedron_3 is the same. Not 
noticeably slower or faster. Boolean operations are also not much affected, 
mostly only 5 to 10 % faster, but one example was indeed 3 times faster. 
The big gain was found in the conversion back from Nef_Polyhedron_3 to 
Polyhedron_3. There I see an improvement from 411mS to 20.5mS so 20 times 
faster. 

I am afraid that CGAL is way too slow for our application.

Many thanks,
Martein Bakker


-----Original Message-----
From: Sylvain Pion 
[mailto:]
 
Sent: maandag 2 november 2009 17:14
To: 

Subject: Re: [cgal-discuss] Performance of boolean operations on 
Nef_polyhedron_3

Bernd Gaertner wrote:
> 
>  wrote:
>> I get the best results with the following Kernel definition:
>>
>> typedef CGAL::Lazy_exact_nt<CGAL::Quotient<CGAL::MP_Float>> NT;
>> typedef CGAL::Simple_cartesian<NT> Kernel;
> 
> Did you try CGAL::Exact_predicates_inexact_constructions_kernel?

I am afraid Nef needs exact constructions.

-- 
Sylvain Pion
INRIA Sophia-Antipolis
Geometrica Project-Team
CGAL, http://cgal.org/
-- 
You are currently subscribed to cgal-discuss.
To unsubscribe or access the archives, go to
https://lists-sop.inria.fr/wws/info/cgal-discuss