CGAL users discussion list

[Olivier Devillers <>]

Le 4/29/13 5:58 PM, Evan Behar a écrit :
> Hi,
>
> I have computed many Plane_3 from points and vectors that I am given, 
> and I want to combine them into a convex polyhedron. I have been 
> trying to do this by constructing Nef_polyhedron_3 from the Plane_3 to 
> create the halfspace and then iteratively intersecting the 
> Nef_polyhedron_3, however this becomes quite slow after a while.
>
> It is not important that I specifically have a Nef_polyhedron_3, a 
> Polyhedron_3 will work just fine. Given that, is there a canonical, 
> efficient way to compute a convex polyhedron from the intersection of 
> half-spaces?

If you know a point inside the intersection then, by duality, an 
intersection of half spaces corresponds to a 3D convex hull of points.