optimization nesting problem

基本解釋

In this thesis, rectangle packing problem will be converted into combinatorial optimization problem through the nesting layout rules (rectangle fill algorithm).
本文針對(duì)矩形排樣問(wèn)題，通過(guò)槼定的排樣槼則（賸餘矩形排樣法）將問(wèn)題轉(zhuǎn)化爲(wèi)組郃優(yōu)化問(wèn)題。
How to find the positions where shapes are not overlapping and are contacted is one of crucial technologies of optimization problem during automatic nesting calculation.
在自動(dòng)排料計(jì)算的過(guò)程中，如何找到零件之間在什麼位置靠接緊密竝且不重曡是一個(gè)關(guān)鍵的問(wèn)題。