Skip to Content.
Sympa Menu

cgal-discuss - Re: [cgal-discuss] [3d_boolean_ops] Most Efficient Rational Kernel

Subject: CGAL users discussion list

List archive

Re: [cgal-discuss] [3d_boolean_ops] Most Efficient Rational Kernel


Chronological Thread 
  • From: "Max" <>
  • To: "" <>
  • Subject: Re: [cgal-discuss] [3d_boolean_ops] Most Efficient Rational Kernel
  • Date: Tue, 19 Feb 2008 10:47:02 +0800
  • Disposition-notification-to: "Max" <>
  • Organization: LoadCom

I have the same question.
The kernel type Cartesian<Gmpq> works well for me with Nef_3 so far
(with the continuous help of Peter), but it's a little bit slower
than my expection. :-)

B/Rgds
Max

>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
>--
>You are currently subscribed to cgal-discuss.
>To unsubscribe or access the archives, go to
>https://lists-sop.inria.fr/wws/info/cgal-discuss



Archive powered by MHonArc 2.6.16.

Top of Page