CGAL users discussion list

[Bernd Gaertner <>]

 wrote:
> I'd like to find vertices of convex hull of points in arbitrary dimension 
> using
> Convex_hull_d. I just tried the 9 points of square centered at the origin.
> Obviously, I should get 4 points, but I'm getting 8. Any thought?

The algorithm promises that the boundary of the hull is represented as a 
simplicial complex, but it does not promise that this simplicial complex 
is minimal. I therefore guess that what you get is correct according to 
the specifications of the algorithm.

Best,
Bernd.