CGAL users discussion list

[Peter Hachenberger <>]

We use a kd-tree for point location and ray shooting. But I guess
that was not what you were asking for, was it? Look into
the manual to get an idea of the data structure, or have
a look at the papers on our implementation for a deeper
insight.

http://www.win.tue.nl/~phachenb/Nef/Nef3D-DataStructureAlgorithms.pdf

Peter

-----"naresh" <> wrote: -----

To: <>
From: "naresh" <>
Date: 05/11/2009 10:52AM
Subject: Re: [cgal-discuss] Nef_3 Question

Hi

> Unfortunately, the algorithms from the Nef package can not work with
> inexact numbers. I think one would need to use a completely different
> approach to make booleans work with inexact math, but that would
> probably sacrifice correctness in certain cases.

Is the polyhydron intersection is implemented with BSP tree ?



----- Original Message -----
From: "Bart Janssens" <>
To: <>
Sent: Saturday, May 09, 2009 8:57 PM
Subject: Re: [cgal-discuss] Nef_3 Question


> On Sat, May 9, 2009 at 1:20 PM, naresh <> wrote:
>> I am trying to find two polyhydron intersection in nef_3 package. But i
>> found process is very slow because of exact arithmatic calculations.
>>
>> So i have question can i use use inexact arithmatic that gives me speed ?
>
> Hi Alex,
>
> Unfortunately, the algorithms from the Nef package can not work with
> inexact numbers. I think one would need to use a completely different
> approach to make booleans work with inexact math, but that would
> probably sacrifice correctness in certain cases.
>
> Cheers,
>
> --
> Bart
> --
> You are currently subscribed to cgal-discuss.
> To unsubscribe or access the archives, go to
> https://lists-sop.inria.fr/wws/info/cgal-discuss
>

--
You are currently subscribed to cgal-discuss.
To unsubscribe or access the archives, go to
https://lists-sop.inria.fr/wws/info/cgal-discuss