Minimum volumetric convex hull tetrahedron

Question

I would like to learn about possible algorithms for finding the minimum volume that limits (describing) the tetrahedron to a given convex hull. I just basically want to approximate an arbitrary three-dimensional shape, originally defined as a point cloud, in the form of a tetrahedral shape.

Answer 1

You can try the marching cube with tetrahedons.