http://debianws.lexgopc.com/wiki143/index.php?action=history&feed=atom&title=Nesting_algorithm 2026-10-25T17:01:45Z Revision history for this page on the wiki MediaWiki 1.43.1 http://debianws.lexgopc.com/wiki143/index.php?title=Nesting_algorithm&diff=4043925&oldid=prev 2025-04-02T16:47:54Z

<p>Closing marge merge proposal; uncontested objection and no support; see <a href="/wiki143/index.php?title=Talk:Packing_problems#Proposed_merge_with_Nesting_algorithm" title="Talk:Packing problems">Talk:Packing problems#Proposed merge with Nesting algorithm</a></p> <p><b>New page</b></p><div>{{Short description|Optimizing algorithm}}<br /> {{refimprove|date=September 2015}}<br /> [[Image:NestingTypes01.jpg|thumb|right|Pictorial representations of three different types of nesting algorithms: Linear, Plate and Packing]]<br /> &#039;&#039;&#039;Nesting algorithms&#039;&#039;&#039; are used to make the [[Nesting (process)|most efficient use]] of material or space. This could for instance be done by evaluating many different possible combinations via [[Recursion (computer science)|recursion]].<br /> <br /> #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.<br /> #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.&lt;ref name=a /&gt;<br /> #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 space|three-dimensional]] objects.<br /> <br /> &lt;ref name=a&gt;{{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}}&lt;/ref&gt;<br /> <br /> ==References==<br /> {{Reflist}}<br /> <br /> [[Category:Geometric algorithms]]<br /> <br /> <br /> {{science-software-stub}}</div>

imported>Klbrain