CGAL users discussion list

[Stephen Wong <>]

Hi there,

 

I am wondering what is the most computationally-efficient kernel that is allowable in Nef Polyhedra in 3D (Boolean operations), in the set of rational numbers Q.  Right now I am using Cartesian<Gmpq>, a variant of Exact_predicate_exact_constructions_kernel.  I am wondering if there is a Kernel (than I have stated) that performs more efficiently.  If not, is there a more efficient number type than Gmpq that is compatible with 3D Nef Polyhedra?

 

On the same topic of discussion, if I were to use kernels representing Z, which is the most efficient kernel?

 

Thanks,

 

Stephen