Nesting algorithm: Difference between revisions
Content deleted Content added
m Normalize {{Multiple issues}}: Remove {{Multiple issues}} for only 1 maintenance template(s): Refimprove |
link to nesting process |
||
| Line 3: | Line 3: | ||
[[Image:NestingTypes01.jpg|thumb|right|Pictorial representations of three different types of nesting algorithms: Linear, Plate and Packing]] |
[[Image:NestingTypes01.jpg|thumb|right|Pictorial representations of three different types of nesting algorithms: Linear, Plate and Packing]] |
||
'''Nesting algorithms''' are used to make the most efficient use of material or space by evaluating many different possible combinations via [[Recursion (computer science)|recursion]]. |
'''Nesting algorithms''' are used to make the [[Nesting (process)|most efficient use]] of material or space by evaluating many different possible combinations via [[Recursion (computer science)|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. |
#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. |
||
Revision as of 08:18, 11 November 2022
 | This article needs additional citations for verification. (September 2015) |
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.
- 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 two-dimensional objects.[1]
- 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.
References
- ^ a b Herrmann, Jeffrey; Delalio, David. "Algorithms for Sheet Metal Nesting" (PDF). IEEE TRANSACTIONS ON ROBOTICS AND AUTOMATION. Retrieved 29 August 2015.
 | This scientific software article is a stub. You can help Wikipedia by expanding it. |