I'm interested in packing the 3 space as dense as possible using equally sized tori whose major radius is much bigger than their minor radius in.
Do you have any idea how to attack this problem? I'm fairly new to this topic and I haven't found many papers for non-convex objects. (I think that the torus is somehow the easiest non convex object.)
I thought about writing some computer simulation to get a feeling for the problem. Also I think that the densest packing will be an irregular packing.
Any comments are appreciated.