Optimal nesting of irregular convex blanks in strips via an exact algorithm

In manufacturing operations where identical blanks are cut from long strips of raw material, the orientation of the blank strongly affects material utilization. This paper describes a new algorithm for optimising the layout of an irregular convex polygonal blank in a strip. This algorithm orients a single blank such that the utilization of the strip material is maximized. It is efficient, running in O(n2) time, and exact, producing orientation …