EFFICIENT NESTING OF CONGRUENT CONVEX FIGURES

[1] SOLUTION OF RECTANGULAR CUTTING-STOCK PROBLEM [J]. IEEE TRANSACTIONS ON SYSTEMS MAN AND CYBERNETICS, 1976, 6 (04): : 302 - 310

[2] A HEURISTIC SOLUTION OF THE RECTANGULAR CUTTING STOCK PROBLEM [J]. COMPUTER JOURNAL, 1980, 23 (04) : 338 - 343

[3] Chazelle B., 1981, POLYGON CONTAINMENT

[4] ALGORITHM FOR 2-DIMENSIONAL CUTTING PROBLEMS [J]. OPERATIONS RESEARCH, 1977, 25 (01) : 30 - 44

[5] DECANI P, 1978, J OPER RES SOC, V29, P703

[6] DORI D, COMPUT GR IMAGE PROC

[7] DETERMINING MINIMUM-AREA ENCASING RECTANGLE FOR AN ARBITRARY CLOSED CURVE [J]. COMMUNICATIONS OF THE ACM, 1975, 18 (07) : 409 - 413

[8] GARDNER M, 1979, SCI AM OCT, P22

[9] A LINEAR-PROGRAMMING APPROACH TO THE CUTTING-STOCK PROBLEM [J]. OPERATIONS RESEARCH, 1961, 9 (06) : 849 - 859

[10] MULTISTAGE CUTTING STOCK PROBLEMS OF 2 AND MORE DIMENSIONS [J]. OPERATIONS RESEARCH, 1965, 13 (01) : 94 - &

[1] SOLUTION OF RECTANGULAR CUTTING-STOCK PROBLEM [J]. IEEE TRANSACTIONS ON SYSTEMS MAN AND CYBERNETICS, 1976, 6 (04): : 302 - 310

[2] A HEURISTIC SOLUTION OF THE RECTANGULAR CUTTING STOCK PROBLEM [J]. COMPUTER JOURNAL, 1980, 23 (04) : 338 - 343

[3] Chazelle B., 1981, POLYGON CONTAINMENT

[4] ALGORITHM FOR 2-DIMENSIONAL CUTTING PROBLEMS [J]. OPERATIONS RESEARCH, 1977, 25 (01) : 30 - 44

[5] DECANI P, 1978, J OPER RES SOC, V29, P703

[6] DORI D, COMPUT GR IMAGE PROC

[7] DETERMINING MINIMUM-AREA ENCASING RECTANGLE FOR AN ARBITRARY CLOSED CURVE [J]. COMMUNICATIONS OF THE ACM, 1975, 18 (07) : 409 - 413

[8] GARDNER M, 1979, SCI AM OCT, P22

[9] A LINEAR-PROGRAMMING APPROACH TO THE CUTTING-STOCK PROBLEM [J]. OPERATIONS RESEARCH, 1961, 9 (06) : 849 - 859

[10] MULTISTAGE CUTTING STOCK PROBLEMS OF 2 AND MORE DIMENSIONS [J]. OPERATIONS RESEARCH, 1965, 13 (01) : 94 - &