A comprehensive and robust procedure for obtaining the nofit polygon using Minkowski sums

Computers and Operations Research

Volumn 35, Issue 1, 2008, Pages 267-281

  Bennell, Julia A ^a   Song, Xiang ^a  

^a UNIVERSITY OF SOUTHAMPTON   (United Kingdom)

Author keywords

Configuration space; Cutting and packing; Geometric algorithms; Nesting

Indexed keywords

ALGORITHMS; AUTOMATION; COMPUTATIONAL GEOMETRY; CUTTING; PROBLEM SOLVING; ROBUST CONTROL;

CONFIGURATION SPACE; GEOMETRIC ALGORITHMS; NESTING;

COMPUTATIONAL METHODS;

EID: 34250217767     PISSN: 03050548     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.cor.2006.02.026     Document Type: Article

References (24)

1. Adamowicz M., and Albano A. Nesting two dimensional shapes in rectangular modules. Computer Aided Design 8 1 (1976) 27-33
2. Mehadevan A. Optimization in computer aided pattern packing. PhD dissertation, North Carolina State University; 1984.
3. Konopasek M. Mathematical treatments of some apparel marking and cutting problems. US Department of Commerce Report; 1981. 99-26-90857-10.
4. Oliveira JF, Ferreira JS. Algorithms for nesting problems. In: Vidal RVV, editor. Applied simulated annealing. Lecture notes in economics and maths systems, vol. 396. Berlin: Springer, p. 255-74.
5. Babu R.A., and Babu R.N. A genetic approach for nesting of 2D parts in 2D sheets using genetic and heuristic algorithms. Computer-Aided Design 33 (2001) 879-891
6. Wäscher G, Haußner H, Schumann H. An improved typology of cutting and packing problems. Working Paper. Faculty of Economics and Management, Otto von Guericke University, Magdeburg; 2005.
7. Minkowski H. Volumen und Oberflache. Mathematische Annalen 57 (1903) 447-495
8. Ghosh P.K. A unified computational framework for Minkowski operations. Computers and Graphics 17 4 (1993) 357-378
9. Ghosh P.K. An algebra of polygons through the notion of negative shapes. CVGIP: Image Understanding 54 1 (1991) 119-144
10. Bennell J.A., Dowsland K.A., and Dowsland W.B. The irregular cutting-stock problem-a new procedure for deriving the nofit polygon. Computers and OR 28 (2001) 271-287
11. Bennell JA. Incorporating problem specific knowledge into a local search framework for the irregular shape packing problem. PhD dissertation, EBMS. University of Wales, Swansea, UK; 1998.
12. O'Rourke J. Computational geometry in C. 2nd ed. (1998), Cambridge University Press, Cambridge
13. Cunninghame-Green R. Geometry. Shoemaking and the milk tray problem. New Scientist 1989, 1677: (12th August); 50-3.
14. Kaul A, O'Connor MA, Srinivasan V. Computing Minkowski sums of regular polygons. Proceedings of the third canadian conference on computational geometry, British Columbia: Vancouver; 1991. p. 74-7.
15. deBerg M., van Kreveld M., Overmars M., and Schwartzopf O. Computational geometry: algorithms and applications (2000), Springer, Berlin
16. Burke EK, Hellier RSR, Kendall G, Whitwell G. Complete and robust no-fit polygon generation for the irregular stock cutting problem. Working paper, ASAP, School of Computer Science, University of Nottingham, UK; 2005.
17. Watson P.D., and Tobias A.M. An efficient algorithm for the regular W1 packing of polygons in the infinite plane. Journal of the Operational Research Society 50 (1999) 1054-1062
18. Li Z., and Milenkovic V.J. Compaction and separation algorithms for non-convex polygons and their applications. European Journal of Operational Research 84 (1995) 539-561
19. Agarwal P.K., Flato E., and Halperin D. Polygon decomposition for efficient construction of Minkowski sums. Computational Geometry Theory and Applications 21 (2002) 39-61
20. Stoyan Y., Terno J., Scheithauer G., Gil N., and Romanova T. Phi functions for primary 2D-objects. Studia Informatica Universalis 2 1 (2001) 1-32
21. Stoyan Y, Scheithauer G, Gil N, Ramanova T. Phi-functions for complex 2D-objects. Technical Report, MATH-NM-2-2002; April 2002, Technische Universitat Dresden.
22. ESICUP. European working group on cutting and packing. 〈http:/www.apdio.pt/sicup〉, 2005.
23. Ramkumar GD. An algorithm to compute the Minkowski sum outer face of two simple polygons. Proceedings of the 12th annual symposium on computational geometry. 1996. p. 234-41.
24. Chazelle B., and Edelsbrunner H. An optimal algorithm for intersecting line segments in the plane. Journal of Association in Computing 39 (1992) 1-54