Subject: CGAL users discussion list
List archive
- From: Olivier Devillers <>
- To:
- Subject: Re: [cgal-discuss] Intersection of two CONVEX 3D polyhedrons
- Date: Wed, 23 Apr 2014 09:15:46 +0200
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 à |
- Re: [cgal-discuss] Intersection of two CONVEX 3D polyhedrons, TL3SHI2, 04/23/2014
- <Possible follow-up(s)>
- Re: [cgal-discuss] Intersection of two CONVEX 3D polyhedrons, TL3SHI2, 04/23/2014
- Re: [cgal-discuss] Intersection of two CONVEX 3D polyhedrons, Olivier Devillers, 04/23/2014
- Re: [cgal-discuss] Intersection of two CONVEX 3D polyhedrons, TL3SHI2, 04/23/2014
- Re: [cgal-discuss] Intersection of two CONVEX 3D polyhedrons, Andreas Fabri, 04/23/2014
- Re: [cgal-discuss] Intersection of two CONVEX 3D polyhedrons, TL3SHI2, 04/23/2014
- Re: [cgal-discuss] Intersection of two CONVEX 3D polyhedrons, Olivier Devillers, 04/23/2014
Archive powered by MHonArc 2.6.18.