CGAL users discussion list

[Markus Maier <>]

Dear all,

I use Nef_polyhedron_3 in CGAL in order to compute the intersection of a 
(large) number of half spaces in 3D. Using and extended cartesian kernel 
with number type Gmpq, everything works fine. However, the time and 
space requirements are very high.
Is there a possibility to use floating-point arithmetic for 
Nef_polyhedron_3? Or do you know other ways of computing the 
intersection of half spaces using floating-point arithmetic?
Thank you in advance.

Best,

Markus