A HEURISTIC ALGORITHM FOR RECTANGULAR PACKING BASED ON BINTREE EXPRESSION
一种基于二叉树结构表达的矩形物体布局的启发式方法

in this paper,a method using bintree structure to express the packing space for rectangular packing is proposed. Through the sequential decomposition of the packing space,the optimal packing scheme of varioussized rectangular packing can be obtained by every time putting the optimal packing element that satisfy specular conditions toward cur rentpacking space and locating it at the up-left corner of the current packing space.Different optimal packing schemes that satisfy different demands can be obtained by adjusting the value of the ordering factors KA and KB.In addition,the packing schemes obtained satisfy the guillotine cutting demands in glass industry.The experimental results indicate that the algorithm is flexible and effective.