well I am crossing my fingers and I hope that will work.
The tetrahedral is an ideal building, because satisfy many conditions that can be all deduce from the geometry, for example for example you can impose a condition that the perturbed the volume can never be less than some positive value. also the tetrahedral only have on local minimal, this means that as long is does not flip the shape will tend to recover it zero energy position. This si no the case for a box, which has many local minimal of zero energy.
The think is that any convex volume can be represent by a set of N tetrahedral, and any close manifold shape can be decomposed into a series of voronoid convex volume, so any close mesh can be easily converted to a tetrahedral mesh by doin those two steps.
The cool thing is that the algorithm extend to user specified resolution. so we do no have to worry about that too much, the important part now if to have a robust solver.
Her is an example how to do a Box as a series of joint tetra.
one is the systematic generic, which is good for the algorithm I described above.
https://www.ics.uci.edu/~eppstein/projects/tetra/
the second is a hand code special case that does with only five Tetra of more regular side.
This is the method use by a technique called Marching Tetrahedra algorithm,
This is actually very, very interesting because this one allow for much lower representation of a mesh.
and then use ISO surface reconstruction for calculate weights for higher resolution mesh.
This is the technique I am going for.
but I am getting too ahead her, now I am going to make a demo that show a simple cube made of tetra and another that represent a beam of cubes. see how that goes and see if all my asumptions and expectation are justified.