STOCK CUTTING OF COMPLICATED DESIGNS BY COMPUTING MINIMAL NESTED POLYGONS

References

• Aggarwal , A. , Booth , H. , O'Rourke , J. , Suri , S. , [a-z]ap. C. K. ( 1989 ) Finding minimal convex nested polygons . Information and Computation . 83 , ( 1 ), 98 – 110 .
   Web of Science ®Google Scholar
• Bhadury , J. and Chandrasekaran , R. ( 1994 ) Stock cutting to minimize cutting length . European Journal of Operational Research ( to appear ).
   Google Scholar
• Bhadury , J. and Chandrasekaran , R. ( 1993 ) Finding the set of all minimal nested convex polygons. Working Paper , University of New Brunswick , Fredericton , Canada .
   Google Scholar
• Chandru , V. , Ghosh , S. K. , Maheshwari , A. , Rajan , V. T. and Saluja , S. ( 1991 ) NC-algorithms for minimum link path and related problems . Technical Report No, CC-91-4 , Institute for Interdisciplinary Engineering Studies, Purdue University .
   Google Scholar
• Christofides , N. , [a-z]hitlock.C. ( 1977 ) An algorithm for two dimensional cutting problems . Operations Research . 25 , 30 – 44 .
   Web of Science ®Google Scholar
• Dori , B. and Ben-Assat , M. ( 1983 ) Circumscribing a convex polygon by a polygon of fewer sides with minimum area addition . Computer Vision, Graphics and Image Processing , 24 , 131 – 159 .
   Google Scholar
• Ghosh , S. K. ( 1991 ) Computing the visibility polygon from a convex set and related problems . Journal of Algorithms , 12 , 75 – 95 .
   Google Scholar
• Ghosh , S. K. , Maheshwari, A.. Pal , S. P. , Saluja , S. , [a-z]eni Madhavan , C. E. ( 1993 ) Characterizing weak visibility polygons and related problems . Computational Geometry Theory and Applications , 3 ( 4 ), 213 – 233 .
   Web of Science ®Google Scholar
• Ghosh , S. K. , [a-z]aheshwari, A, ( 1990 ) Optimal algorithm for computing minimal nested non-convex polygons . Information Processing Letters , 36 , 277 – 280 .
   Google Scholar
• Gilmore , P. C. and Gomory , R. E. ( 1961 ) A linear programming approach to the cutting stock problem . Operations Research , 9 , ( 6 ), 849 – 859 .
   Web of Science ®Google Scholar
• Gilmore , P. C. and Gomory , R. E. ( 1963 ) A linear programming approach to the cutting stock Problem-Part II . Operations Research , 11 , ( 6 ), 863 – 888 .
   Web of Science ®Google Scholar
• Preparata , F. P. and Shamos , M. I. ( 1985 ) Computational Geometry; An Introduction . Springer-Verlag
   Google Scholar
• Reif , J. H. and Storer , J. A. ( 1987 ) Minimizing turns for discrete movement in the interior of a polygon . IEEE Journal on Robotics and Automation , RA- 3 , 182 – 193 .
   Google Scholar
• Suri , S. ( 1986 ) A linear lime algorithm for minimum link paths inside a simple polygon . Computer Vision, Graphics ami Image Processing , 35 , 99 – 110 .
   Google Scholar
• Vcnkateswarlu , P. , [a-z]artyn. C. W. ( 1992 ) The trim-loss problem in a wooden drum industry . OR-92 Proceedings of the Convention of Operational Research Society of India .
   Google Scholar