I am looking for a deterministic implementation for any 3d bin packing algorithm, i.e. for packing many small and different cuboids inside one or many bigger ones. The solution could vary from the optimal one.
It should be written in C, C++, Java, C#, IronPython, IronRuby or any other language an can bin to from .Net code.
I found this C algorithm http://www.diku.dk/hjemmesider/ansatte/pisinger/3dbpp.c , but it doesn’t rotate the cuboids to find the best fit. I am ok with not rotating them upside down, but horizontal rotation should be possible.
I have written an approximate algorithm for the case you describe i.e. 3D rectangular boxes, with orthogonal rotation, in C++.
You can find the results and algorithm in the published paper:
http://www.cs.ukzn.ac.za/publications/erick_dube_507-034.pdf