It's been a while, that I'm searching some information about this problem.
Suppose we have some irregular $3D$ shape, the problem is to give an algorithm, to find exactly 1 nested basic shape, which has maximal volume among all other possibilities.
Saying basic shape, I mean - cube, cylinder, sphere, etc.
Google pointed me to some $2D$ analog problems. It seems to be, this problem is highly related with packing(nesting) problems. Some related SO links below.
Computational complexity and shape nesting
Best nesting algorithm
Nesting maximum amount of shapes on a surface
And according to answers, these class of problems seems to be at least NP complete. Anyways, I did not get the full picture, and left with few questions.
- I was hoping to find a simple solution, maybe I shouldn't have complicated problem this far, and there's a really simple solution?
- What kind of approaches could be "best" for this particular problem to use?
- Maybe I'm digging in wrong direction? (packing problems are not related)
Any kind of references and readings are much appreciated. thank you