CGAL users discussion list

[Laurent Rineau <>]

On Wednesday 08 August 2007 02:09:07 Satyajit Sarangi wrote:
> Hi Laurent,
>             Thanx for the answer. However, the result which I was expecting
> didn't turn out. What I exactly wanted to do was to get the convex hull of
> certain points in 3D by using Delaunay triangulation and then only
> considering the cells which were infinite and extracting the finite
> triangle from the cells. It would be great if you could give me an idea
> about how to go about it.

Monique answered your question. However, the 3D Delaunay triangulation is an 
overkill, in my opinion, to address your problem. You should have a look at 
the 3D convex hull package, that can compute the polyhedron corresponding to 
the convex hull of a set of points.

If you try both methods, please tell us which one is the quickest, on your 
data. We, CGAL developers, miss feedback about methods that work for our 
users (we usually have only feedback about things that do not work).

(Anyway, please verify that you have the right to use CGAL. If you have not 
bought a commercial CGAL license from GeometryFactory, your code need to be 
released under an open source license compatible with both LGPL and QPL. If 
your lab plans to make non-open source software from CGAL, it should buy CGAL 
licenses.)

-- 
Laurent Rineau
INRIA - Sophia Antipolis
BP 93, 2004 Route des Lucioles
06902 Sophia Antipolis Cedex FRANCE
Tel: +33 4 92 38 78 62