Description
Nesting algorithms are used to make the most efficient use of material or space by evaluating many different possible combinations via recursion. Linear (1-dimensional): The simplest of the algorithms illustrated here. For an existing set there is only one position where a new cut can be placed ? at the end of the last cut. Validation of a combination involves a simple Stock - Yield - Kerf = Scrap calculation.

Posted By: John Saccuan