Suppose 3d space has certain number of random points. All these points can be enclosed on a surface made up of triangular elements such that vertices of these triangles are the random points with the condition that surface area gets maximised . I'm interested in finding the volume enclosed by this whole surface (i.e. of polyhedra).

Quickhull algorithm finds the convex body around these points. In this case, some concave part of the surface needs to be accounted such that the min volume enclosing all the random points is obtained. There are some known algorithms which give volume for such polyhedras provided the points forming each of the outer triangular elements are given. 

I am looking for some **algorithm which provides the outermost triangular elements**. Eventual computer code will be written based on this algorithm.

PS: modified to include condition on surface area