Nesting algorithm

<p>Nesting algorithms are used to make the <a href="/facts/Nesting_(process)/AEv4d1WI">most efficient use</a> of material or space. This could for instance be done by evaluating many different possible combinations via <a href="/facts/Recursion_(computer_science)/2uXo18Gv">recursion</a>.
</p>
<ol><li>Linear (1-dimensional): The simplest of the <a href="/facts/Algorithms/fnl5NmRt">algorithms</a> 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 - <a href="/facts/Kerf/mh8PG7xy">Kerf</a> = Scrap calculation.</li>
<li>Plate (2-dimensional): These algorithms are significantly more complex. For an existing set, there may be as many as eight positions where a new cut may be introduced next to each existing cut, 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 <a href="/facts/Two-dimensional/f4b397W8">two-dimensional</a> objects.</li>
<li>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 <a href="/facts/Three-dimensional_space/KAqKWUbS">three-dimensional</a> objects.</li></ol>
<p>
</p>

Nesting algorithm open-in-new

Nesting algorithm