There are a number of issues with convex hulls which are not so easy to solve. For example calculation of the volume of overlapping hulls. Calculating volume of the pyramid is easy but calculating volume and center of volume of it’s intersection with another pyramid turns into a costly routine where more than necessary triangles are involved in calculation. Tracing visibility of the triangle is another difficult part - many corner cases where triangle is partially visible but big enough to be significant.
It seams that voxels can handle such cases more gracefully but this is just speculation and I agree with higher memory expense. Perhaps I’m not being eloquent enough. I’ll dig up few papers which describe this approach.