Subject: CGAL users discussion list
List archive
- From: Vahid Azizi <>
- To:
- Subject: [cgal-discuss] finding intersection between two 3D convex hull
- Date: Fri, 26 Aug 2016 14:52:12 -0400
- Authentication-results: mail2-smtp-roc.national.inria.fr; spf=None ; spf=Pass ; spf=None
- Ironport-phdr: 9a23:9Ca6uh1qM4/Uo8qGsmDT+DRfVm0co7zxezQtwd8ZsesRKfad9pjvdHbS+e9qxAeQG96KsrQY06GP6fmoGTRZp83e4DZaKN0EfiRGoPtVtjRoONSCB0z/IayiRA0BN+MGamVY+WqmO1NeAsf0ag6aiHSz6TkPBke3blItdaymUrLV2s+43uT395zIaBhTnxK8Z6lzJVO4t1b/rM4T1LVrKqc9gjLbo2lJM7BIzCVhN1OBnj7z486x+Nho9CEG6KFpzNJJTaivJ/dwdrdfFjlza20=
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
- [cgal-discuss] finding intersection between two 3D convex hull, Vahid Azizi, 08/26/2016
- Re: [cgal-discuss] finding intersection between two 3D convex hull, Sebastien Loriot (GeometryFactory), 08/29/2016
Archive powered by MHonArc 2.6.18.