Nesting algorithm: Difference between revisions
Content deleted Content added
Added a reference that discusses heuristic algorithms for the second case |
m WP:CHECKWIKI error fix for #03. Missing Reflist. Do general fixes if a problem exists. - using AWB (11377) |
||
| Line 10: | Line 10: | ||
#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.<ref name=a /> |
#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.<ref name=a /> |
||
#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. |
#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. |
||
| ⚫ | |||
==References== |
|||
{{Reflist}} |
|||
[[Category:Geometric algorithms]] |
[[Category:Geometric algorithms]] |
||
| Line 15: | Line 19: | ||
{{science-software-stub}} |
{{science-software-stub}} |
||
| ⚫ | |||
Revision as of 06:55, 30 August 2015
 | This article has multiple issues. Please help improve it or discuss these issues on the talk page. (Learn how and when to remove these messages)
|
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. |