Algorithm for cutting plane

Asked

Viewed 2,096 times

5

I don’t know if this is the best place to ask this question, but I searched the Internet a lot for some algorithm for cutting plan - that informing the dimensions of the pieces it shows the best arrangement so that it costs as little as possible.

Does anyone know an algorithm close to that reality?

inserir a descrição da imagem aqui

algorithm geometry

  • I have seen such a system working in a joinery, so there is already ready. Have you done any search on prioritization by size? I think it might be a good place to start.

  • I found this material: http://www.dct.ufms.br/~eah/Pli/cut-off plans-4p.pdf - extremely academic and not very didactic

1 answer

7


The name of this type of algorithm in English is Bin Packing, a variant of backpack problem.

A binary tree is used to select, in several passes, the best distribution (optimal Distribution) content in order and percentage of area use.

An excellent algorithm implementation can be found here: http://codeincomplete.com/posts/2011/5/7/bin_packing/

Example of use:
http://codeincomplete.com/posts/2011/5/7/bin_packing/example/

I took the liberty of testing the areas of your sample image in the algorithm demo. This is the result (I divided the dimensions by 10 and rounded the values):

inserir a descrição da imagem aqui

Browser other questions tagged algorithm geometry

You are not signed in. Login or sign up in order to post.