I have a question that is similar to [this one asked before](https://scicomp.stackexchange.com/questions/2771/is-there-a-special-algorithm-for-computing-the-convex-hull-ordering-when-the-can) except in 3D, and I only need the volume, not the actual shape of the hull.

More precisely, I'm given a small set of points (say, 10-15) in 3D, all of which are known to lie on the convex hull of the point set (so they all "matter" and define the hull). I only want to compute the volume of the hull, I don't care about computing the actual polyhedron. Is there an efficient algorithm to do this?