CGAL users discussion list

["Sebastien Loriot (GeometryFactory)" <>]

If you want to intersect two convex hulls, you can try using
CGAL::halfspace_intersection_3 or 
CGAL::halfspace_intersection_with_constructions_3, each face of your
input convex hulls being representing as a half-space.

Best,

Sebastien.


http://doc.cgal.org/latest/Convex_hull_3/group__PkgConvexHull3Functions.html#ga6118d2c46934c541669ab871f8e1fd24

http://doc.cgal.org/latest/Convex_hull_3/group__PkgConvexHull3Functions.html#ga5c2ab0e6e63557e65ad7f2bdc3c351fc


On 08/26/2016 08:52 PM, Vahid Azizi wrote:
> Hi all,
>
> I am totally a newbie user and i need some tips for finding intersection
> between two 3D convex-hull. I explain what i am doing in below:
>
> I have a mesh which i need to find the adjacent triangles which have
> same surface normal, i did this part with my self. After this step i
> need to create a surface out of these triangles which i used
> convex_hull_3 in CGAL. Now i need to find the bounded convex hull
> between two of these convex-hulls after some processing. I read "3D
> Boolean operation on nef polyhedra" and some arbitrary pages on internet
> but i didn't get what i need to do exactly? The issue is i need to have
> the vertices of bounded convex-hull and i didn't get is it possible by
> CGAL functionality or not? if it is possible I appreciate if you could
> provide me some tips or links. Thank you so much  in advance.
>
> Best,
> --
> /Vahid/