CGAL users discussion list

[Costas Tsirogiannis <>]

Thanks a lot Sebastien :)

cheers,

C.

On Tue, Dec 2, 2014 at 1:37 PM, Sebastien Loriot (GeometryFactory) <> wrote:

On 11/26/2014 11:52 AM, Costas Tsirogiannis wrote:

Greetings,

Hi Costas,

I have been looking in the CGAL manual to try to find possible ways that
I could compute for two convex polytopes the volume value of their
intersection. From what I can understand, the highest dimension that I
can currently do this is three; express these polytopes as Nef
polyhedra, do the intersection operation and convert them back to a
polyhedron. I would like to ask if there is any other (faster) way to do
this for three dimensions, and of course, if the current version
supports this computation for higher dimension polytopes.

You can use the duality.
Have a look at this thread:
http://cgal-discuss.949826.n4.nabble.com/How-to-efficiently-compute-intersection-of-half-planes-td4657312.html

Sebastien.

thanks in advance,

--Constantinos

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