Nesting algorithm: Difference between revisions

Content deleted Content added

Inline

Revision as of 05:21, 17 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.

^ ^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.

@@ Line 1: / Line 1: @@
 {{multiple issues|
 {{Orphan|date=February 2013}}
-{{unreferenced|date=July 2007}}
+{{refimprove|date=September 2015}}
 }}
@@ Line 12: / Line 12: @@
 <ref name=a>{{cite web|last1=Herrmann|first1=Jeffrey|last2=Delalio|first2=David|title=Algorithms for Sheet Metal Nesting|url=http://www.isr.umd.edu/Labs/CIM/projects/nesting/sheetmetal.pdf|publisher=IEEE TRANSACTIONS ON ROBOTICS AND AUTOMATION|accessdate=29 August 2015}}</ref>
 ==References==
 {{Reflist}}