TY - JOUR
T1 - Optimal packing using the multiple mating method
AU - Yu, C.
AU - Manoochehri, S.
PY - 2003
Y1 - 2003
N2 - A new method for the solution of the packing problem is presented. The method introduces a mating concept to the problem. The mating allows one or more objects to be positioned relative to the other by applying mating conditions that are derived from the geometric features among them. Once mated, objects within a mating pair or a mating group are treated as one object and do not need to be positioned separately. In addition, overlap calculation among objects within the mating group is not necessary. The algorithm thus brings a significant reduction in search space and the overall time taken to converge.
AB - A new method for the solution of the packing problem is presented. The method introduces a mating concept to the problem. The mating allows one or more objects to be positioned relative to the other by applying mating conditions that are derived from the geometric features among them. Once mated, objects within a mating pair or a mating group are treated as one object and do not need to be positioned separately. In addition, overlap calculation among objects within the mating group is not necessary. The algorithm thus brings a significant reduction in search space and the overall time taken to converge.
KW - Containment
KW - Convex decomposition
KW - Geometric feature mating
KW - Nesting
KW - Packing
UR - http://www.scopus.com/inward/record.url?scp=0041318921&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=0041318921&partnerID=8YFLogxK
U2 - 10.1007/s00366-002-0249-
DO - 10.1007/s00366-002-0249-
M3 - Article
AN - SCOPUS:0041318921
SN - 0177-0667
VL - 19
SP - 56
EP - 65
JO - Engineering with Computers
JF - Engineering with Computers
IS - 1
ER -