Large-scale nesting of irregular patterns using compact neighborhood algorithm
暂无分享,去创建一个
[1] Kamineni Pitcheswara Rao,et al. Quick and precise clustering of arbitrarily shaped flat patterns based on stringy effect , 1997 .
[2] Andrew Y. C. Nee,et al. A Heuristic Algorithm for Optimum Layout of Metal Stamping Blanks , 1984 .
[3] M. Adamowicz. The optimum two-dimensional allocation of irregular, multiply-connected shapes with linear, logical and geometric constraints , 1970 .
[4] Dov Dori,et al. Efficient nesting of congruent convex figures , 1984, CACM.
[5] R. Gomory,et al. A Linear Programming Approach to the Cutting-Stock Problem , 1961 .
[6] Dov Dori,et al. Circumscribing a convex polygon by a polygon of fewer sides with minimal area addition , 1983, Comput. Vis. Graph. Image Process..
[7] John H. Holland,et al. Induction: Processes of Inference, Learning, and Discovery , 1987, IEEE Expert.