How can I get the Largest convex polyhedron of a set of points?

Replies to This Discussion

Permalink Reply by trevor.patt on October 4, 2011 at 7:38am

I assume you must mean the smallest bounding convex polygon (the largest is infinitely so).

Look up Convex Hull in 3d space, Computational Geometry, M. de Berg etal has a chapter on this in easy and understandable language with pseudocode which I'd recommend.