I do not know if this is the best place to ask this question, but I searched a lot on the internet for some algorithm for cutting plan - which, by informing the dimensions of the pieces, shows the best arrangement so that it is minimized as little as possible. / p>
Does anyone know of an algorithm close to this reality?
The name of this type of algorithm in English is Bin Packing , a variant of the backpack problem a>.
A binary tree is used to select, in several passes, the best distribution ( optimal distribution ) of a content in order and percentage of surface use.
An excellent implementation of the algorithm can be found here: link
Example usage:
link
I took the liberty of testing the areas of your sample image in the algorithm demo. This is the result (I've divided the dimensions by 10 and rounded the values):
