CGAL users discussion list

[sharpieboss <>]

I'm new to CGAL and I haven't been able to find an answer to my problem here
or in the documentation. I have a vector “points” of nearly 300 six
dimensional points ( Type point_d ) and I'm trying to compute the six
dimensional convex hull of these points.

Two problems:

(a)
I have a convex_hull_d C, and I do C.insert( points.begin() , points(end) ).
This ends with a segmentation fault. I scaled it back and inserted fewer
points, and it did not result in a segmentation fault. ( I can put in about
100 before it faults )

I need to process all these points.

(b)
The convex hull includes the same number of vertexes as points I put in.
This is more or less a set of random points. Shouldn't some lie inside the
chull, and thus not be added? The number of simplexes has also increased to
the MAXIMUM 64 bit integer value, as well as the number of facets.

Convex_hull_d does not seem to compute the convex hull at all. I also do not
fully understand the data members simplexes and facets.


I am not the most experienced user, so I appreciate you reading and any
input you might lend.

-James




If you are curious as to what I intend to do with the convex hull, I intend
to find the distance from the origin to the closest hyperplane in the convex
hull. This is used as a metric for robotic grasp quality, and I was
previously using qhull executables.



--
View this message in context: 
http://cgal-discuss.949826.n4.nabble.com/Convex-hull-d-computation-help-tp4658051.html
Sent from the cgal-discuss mailing list archive at Nabble.com.