CGAL users discussion list

[TL3SHI2 <>]

Hi, Olivier,
I have a question for using duality to solve this problem.
Considering there are two convex polyhedrons which are not intersect with
each other any all. 
However, using duality, I can map the faces of both of the polyhedrons to
vertices, and the convex hull of the mapped vertices is always exists.
Is it saying that the intersection of the original polyhedrons exists?
I am confused about this problem.



--
View this message in context: 
http://cgal-discuss.949826.n4.nabble.com/Intersection-of-two-CONVEX-3D-polyhedrons-tp4564202p4659179.html
Sent from the cgal-discuss mailing list archive at Nabble.com.