I have a uneven 3d object and need to fit another 3d symmetrical shape (Cone or cylinder) into this. I need to rotate and expand / shrink the symmetrical shape so that we can find the largest fitting cone / cylinder into this rough object.
I have looked at few bin packing problems but all seem to be dealing with rectangular shapes only ( container as well as the object to fit) and do not seem to be exactly meet my requirements.
The algorithm should also be having optimal performance.
What about the paper:
FOLLERT, Frank, et al. Computing a largest empty anchored cylinder, and related problems. International Journal of Computational Geometry & Applications, 1997, 7.06: 563-580.
The abstract says:
A pdf is here.