# Cutting Diagram 7.0 {% hint style="danger" %} This page is currently being written. {% endhint %} {% hint style="info" %} This feature was introduced in version 7.0.0. {% endhint %} ## Computing Cutting Diagrams Cutting diagrams can be solved by a class of algorithms known as [**Bin Packing**](https://en.wikipedia.org/wiki/Bin_packing_problem), albeit with a few twists. We are looking for an *optimal* cutting plan, but what is optimal? The criterion most often used to define optimality is the *least number of bins* necessary to pack a set of boxes. Other criteria to optimize include the size and number of offcuts produced (one large is better than many small), the total length of needed cuts, the number of times the panel needs to be rotated, the number of top-level through cuts, ... {% hint style="warning" %} Cutting diagrams are not available for material of type **Solid Wood**, because they are not meaningful in that context. {% endhint %} ### Limitations Bin Packing problems are notoriously difficult. Even if we cannot guarantee to find a perfect solution, our algorithm tries very hard to find an acceptable solution. {% hint style="warning" %} Cutting diagrams that do not look as you expected do not constitute bugs, and should not be reported as such. {% endhint %} ## Types * **One** (Dimensional) - Cut lengthwise only * **Guillotine** - Cutting into rectangles with through cuts * **Rectangle** - Cutting into nested rectangles * **Nesting** - Cutting with any nested shapes

## Cut Types * **exact**: the number of cutting levels is exactly the same as the input value * **non-exact**: an additional cutting level is allowed, but only to separate a leftover piece from an item * **homogeneous**: this is similar to "exact," but it also requires that the last level of sub-sections contain exactly the same items