An improved method for calculating the no-fit polygon

Computers and Operations Research

Volumn 33, Issue 6, 2006, Pages 1521-1539

  Dean, Hamish T ^a   Tu, Yiliu ^a   Raffensperger, John F ^a  

^a NONE   (New Zealand)

Author keywords

Minkowski sum; No fit polygon; Two dimensional packing

Indexed keywords

ALGORITHMS; MOTION PLANNING; PACKING; PROBLEM SOLVING; RESEARCH; ROBOTS;

MINKOWSKI SUM; NO-FIT POLYGON; NON-CONVEX POLYGON; TWO-DIMENSIONAL PACKING;

COMPUTATIONAL GEOMETRY;

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

References (8)

1. J. O'Rourke Computational geometry in C 1998 Cambridge University Press Cambridge
2. R. Cunninghame-Green Geometry, shoemaking and the milk tray problem New Scientist 1677 1989 50 53
3. Lo Valvo E. A new simple and quick algorithm for the calculation of "no fit polygon" of generic polygons. Working paper.
4. Mahadevan A. Optimisation in computer-aided pattern packing. Ph.D. thesis, North-Carolina State University; 1984.
5. Kendall G. Applying meta-heuristic algorithms to the nesting problem utilising the no fit polygon. Ph.D. thesis, University of Nottingham; 2000.
6. P.K. Ghosh An algebra of polygons through the notion of negative shapes CVGIP Image Understanding 54 1 1991 119 144
7. J.A. Bennell, K.A. Dowsland, and W.B. Dowsland The irregular cutting-stock problem - a new procedure for deriving the no-fit polygon Computers and Operations Research 28 2001 271 287
8. J. Hershberger Finding the upper envelope of n line segments in O (n log n ) time Information Processing Letters 33 1989 169 174