Nesting Algorithms are algorithms used to make the most effecient use of material or space by evaluating many different possible combinations. This can be done with Recursion.
Illustrated to the right are three examples of nesting:
1. 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.
Evaluation of a combination involves a simple Stock - Yield - Kerf = Scrap calculation.
2. Plate (2-dimensional)
These algorithms are significantly more complex.
For an existing set, there may be a large number of positions where a new cut may be introduced, and if the new cut is not perfectly square then different rotations may need to be checked.
Validation of a potential combination involves checking for intersections between two-dimensional objects.
3. Packing (3-dimensional)
These algorithms are the most complex illustrated here due to the larger number of possible combinations.
Validation of a potential combination involves checking for intersections between three-dimensional objects.
