Description: solve the problem : cutting parts, given a width of the rectangular plate W, the height of rectangular plate unrestricted. Need from the board is cutting out respectively n height of the hi, wi width of the rectangular parts. Cutting parts to the rules of the height of the rectangular plate with a high degree of consistent direction. Asked how cutting makes use of the rectangular plate height h minimum? The algorithm uses dc, the final results of using a graphical interface paint. Independent development completed.
To Search:
- [INCISE] - plate for the optimum cut, so as to avoi
- [packing5] - Rectangular Nesting with bl algorithm. W
- [tsp_in_vc] - provide tsp description of the algorithm
- [expr1] - parts cutting issue for a fixed width of
- [ex4] - Parts mutilation given width W of a rect
- [J2EE_Tutorial_zh_CN] - Chinese version of J2EE tutorial explain
- [lingjian_1] - Parts mutilation given width W of a rect
- [chengxu] - To solve a variety of nesting problem, c
- [jx] - Rectangular pieces of nesting of simulat
- [glass] - Glass partition reference code, accordin
File list (Check if you may need any files):
Download