An efficient algorithm for the regular w\ packing of polygons in the infinite plane

Journal of the Operational Research Society

Volumn 50, Issue 10, 1999, Pages 1054-1062

  Watson, P D ^a   Tobias, A M ^a  

^a UNIVERSITY OF BIRMINGHAM   (United Kingdom)

Author keywords

Heuristics; Non convex polygon; Optimisation; Packing

Indexed keywords

EID: 0033410942     PISSN: 01605682     EISSN: 14769360     Source Type: Journal    
DOI: 10.1057/palgrave.jors.2600807     Document Type: Article

References (21)

1. Kepler J (1619). ‘Harmonice Mundi’ Lincii, German translation: Caspar, M (1939). Also: Johannes Keppler Gesammelte Weke, Caspar, M (ed.) Munich: Band VI. Beck, 1940. Reprint: Culture et Civilisation, Brussels, 1968.
2. Grünbaum B and Shephard GC (1987). Tilings and Patterns. W.H. Freeman and Co.: New York.
3. Thue A (1910). Über die dichtest Zusammenstellung von kongruenten Kreisen in einer Ebene. Skr Videnski-Selsk Christ 1: 1-9.
4. Dyckhoff H (1990). A typology of cutting and packing problems. Eur J Opl Res 44: 145-159.
5. Dowsland KA and Dowsland WB (1992). Packing problems. Eur J Opl Res 56: 2-14.
6. Dowsland KA and Dowsland WB (1995). Solution approaches to irregular nesting problems. Eur J Opl Res 84: 506-521.
7. Fejes Toth L (1964). Regular Figures. Pergamon: New York.
8. Ghosh PK (1990). A solution of polygon containment, spatial planning and other related problems using Minkowski operations. Comp Vision, Graphics and Image Process 49: 1-35.
9. Hwang Y and Ahuja N (1992). Gross motion planning. ACM Comp Surveys 24: 209-291.
10. Adamowicz M and Albano A (1972). A two-stage solution of the cutting stock problem. In: Freiman CV (ed). Information Processing North Holland: Amsterdam pp 1086-1091.
11. Manning JR (1974). Regular Arrays of Plane Convex Figures. SATRA Research Report, RR260.
12. Cuninghame-Green RA and Manning JR (1983). An Industrial Cutting Problem. Working Paper, Dept of Maths, University of Birmingham, November 1983.
13. Dori D and Ben-Bassat M (1984). Efficient nesting of congruent convex figures. Commun ACM 27: 228-235.
14. Sparks C (1991). A Lattice Packing Approach to an Industrial Cutting Problem. PhD. Thesis, Dept. Mathematics and Statistics, University of Birmingham.
15. Martin RR and Stephenson PC (1988). Putting objects into boxes. Comput Aided Design 20: 506-514.
16. Watson PD (1997). The Theory of Cutting and Packing of NonInterlocking Shapes in a Bounded Region. Ph.D. Thesis, University of Birmingham.
17. Chazelle BL and Dobkin DP (1979). Decomposing a polygon into its convex parts. In Proceedings of the 11th ACM symposium on the theory of computing, ACM, New York, pp 38-48.
18. Chazelle BL and Dobkin Dp (1985). Optimal convex decompositions. In Toussaint GT (ed). Computational Geometry. Elsevier Science: North Holland, pp 63-134.
19. Pavlidis T (1977). Structural Pattern Recognition. Springer Verlag: New York.
20. Prasad YDKV Somasundaram S and Rao KP (1995). A sliding algorithm for optimal nesting of arbitrarily shaped sheet metal blanks. Int J Prod Res 33: 1505-1520.
21. Dowsland KA, Dowsland WB and Bennell JA (1998). Jostling for position—local improvement for irregular cutting patterns. J Opl Res Soc 49: 647-658.