Dov Dori
Moshe Ben-Bassat
- 1 Adamowicz, M. and Albano, A. A solution of the rectangular cutting stock problem. 1EEE Trans. Syst. Man Cybern. SMC-6, (1976), 302-310.Google Scholar
- 2 Albano, A. and Orisini, R. An heuristic solution of the rectangular cutting stock problem. Comput. J. 23 (1979), 338-343.Google ScholarCross Ref
- 3 Chazelle, B. The polygon containment problem. Dept. of Computer Science, Carnegie-Mellon University, November 1981.Google Scholar
- 4 Christophides, N. and Whitlock, C. An algorithm for two dimensional cutting stock problems. Oper. Res. 25 (1977), 30-44.Google ScholarDigital Library
- 5 DeCani, P. A note on the two dimensional rectangular cutting stock problem. J. Oper. Res. Soc. 29 (1978), 703-706.Google ScholarCross Ref
- 6 Dori, D. and Ben-Basset, M. Circumscribing a convex polygon by a polygon of fewer sides with minimal area addition. Comput. Gr. Image Process. (in press).Google Scholar
- 7 Dyson, R.G. and Gregory, A.S. The cutting stock problem in the flat glass industry. Oper. Res. Quart. 25 (1974), 41-53.Google ScholarCross Ref
- 8 Freeman, H. and Shapira, R. Determining the minimum-area encasing rectangle for an arbitrary closed curve. Commun. ACM 18 (1979), 409-413. Google ScholarDigital Library
- 9 Sklansky, J. and Gonzalez, V. Fast polygonal approximation of digitized curves. Pattern Recog. 11 (1979}, 604-609.Google Scholar
- 10 Gardner, M. Some packing problems that cannot be solved by sitting on the suitcase. Scientific American, (Oct. 1979), 22-26.Google Scholar
- 11 Gilmore, P.C. and Gomory, R.E. A linear programming approach to the cutting stock problem. Oper. Res. 9 (1961), 849-859.Google ScholarDigital Library
- 12 Gilmore, P.C. and Gomory, R.E. Multistage cutting problems of two and more dimensions. Oper. Res. 13 (1965), 94-120.Google ScholarDigital Library
- 13 Gilmore, P.C. and Gomory, R.E. The theory and computation of knap-sack functions. Oper. Res. 15 {1967), 1045-1075.Google Scholar
- 14 Grinbaum, B. and Shepher, G.C. The 81 types of isohedral tilings in the plane. Math. Proc. Cambridge Philosophical Soc. 82 (1977), 122- 146.Google Scholar
- 15 Haims, M.J. and Freeman, H. A multistage solution of the template layout problem. IEEE Trans. Syst. Sci. Cybern., SSC-6 (1970), 145-151.Google Scholar
- 16 Herz, J.C. A recursive computing procedure for two dimensional stock cutting. IBMJ. Res. Dev. 16 (1972), 462-469.Google ScholarDigital Library
- 17 Hinxman, A.I. A two dimensional trim-loss problem with sequencing contraints. Proc. 5th Int. Joint Conf. Artifi lntell. (1977), 859-864.Google Scholar
- 18 Kershner, R.B. On paving the plane. Am. Math. Monthly, 75 (1968) 839-844.Google ScholarCross Ref
Index Terms
- Efficient nesting of congruent convex figures
Recommendations
A Generic Approach for Leather Nesting
ICNC '09: Proceedings of the 2009 Fifth International Conference on Natural Computation - Volume 05This paper presents a novel nesting algorithm for leather manufacturing, such as automobile interior decoration, etc. After the profile of leather sheets and stencils is obtained using a digitizer, it is discretized to make the processing independent of ...
Epigraphical nesting: A unifying theory for the convergence of algorithms
In an earlier paper, the authors introduced epigraphical nesting of objective functions as a means to characterize the convergence of global optimization algorithms. Epigraphical nesting of objective functions may be looked upon as a relaxation of ...
Nesting of reducible and irreducible loops
Recognizing and transforming loops are essential steps in any attempt to improve the running time of a program. Aggressive restructuring techniques have been developed for single-entry (reducible) loops, but restructurers and the dataflow and dependence ...
Comments