CGAL users discussion list

[TL3SHI2 <>]

In fact, I am not very clear about what you said, thank you anyway. By the way do you know some other tools to detect whether two convex polytopes intersect? I used swift, it seems to be not working. Can cgal do this?  I want to use it right now, it is a little difficult for me to implement one in one or two days. 

--
from my phone.


"Olivier Devillers-2 [via cgal-discuss]" <[hidden email]>编写：

Le 4/23/14 4:36 AM, TL3SHI2 a écrit :

Hi, Olivier,
I have a question for using duality to solve this problem.

    
    
    Actually, duality  exchanges points and hyperplanes preserving
    incidences,
    
    to transform convex hull in intersection of half spaces, you do not
    need
    hyperplanes but halfspaces, that is you have to define the relevant
    size
    of your hyperplanes. So to this aim, you need a point known to be
    inside the intersection.
    So, the two problems are not completely equivalent.
    (such a point can be determined solving a LP problem).

--
Olivier Devillers, chercheur à

---

If you reply to this email, your message will be added to the discussion below:

http://cgal-discuss.949826.n4.nabble.com/Intersection-of-two-CONVEX-3D-polyhedrons-tp4564202p4659181.html

To unsubscribe from Intersection of two CONVEX 3D polyhedrons, click here.
NAML

---

View this message in context: Re: Intersection of two CONVEX 3D polyhedrons
Sent from the cgal-discuss mailing list archive at Nabble.com.