Talk:Nesting (process)
 | This article has not yet been rated on Wikipedia's content assessment scale. |
Concept and Importance
[edit]The concept of and importance of nesting is not exclusive to machining. Especially textile nesting (called marker making) with its print with often repeated patterns to be handled, and leather nesting, with its qualities and tolerance on a varying stretch direction are important. Important features can be: multiple sizes, allowed or requested mirrored parts, free rotational tolerance or limited free rotational tolerance (f.i. part dependent 10 degree freedom with respect to 90, 180 or 360 degree steps), optimized variable multiple layers of material, etc. Look for Cutting and Packing for more info. —Preceding unsigned comment added by 217.21.255.44 (talk) 10:39, 28 May 2008 (UTC)
Proprietary
[edit]Why are the nesting algorithms called "proprietary"? Lots of articles have been published on solution to the nesting problem and related problems. And to the best of my knowledge the most widely discussed algorithms are not protected by patents. 217.228.20.224 23:50, 1 April 2007 (UTC)
Computer programs for nesting are proprietory so far as I can find, so I moved the word "proprietory" so it refers to "software" rather than "algorithms" as it did on 1st of April 2007. If anyone could find or write free nesting software, that would be great! Robertson, John. "Nesting Software for Next to Nothing". setting up shop. blogger. Retrieved 10 August 2015.</ref></REF> is my blog post about looking for free or non-proprietory nesting software, without success
Veganline (talk) 13:30, 10 August 2015 (UTC)
Human Nesting behavior
[edit]Why is there not a page on human nesting behavior? Are we engaging in an Orwellian restriction and destruction of word usage? Sequentially contained sets are by no means an exclusive usage. Even a disambiguation page would be preferableAlison W. B. 00:32, 1 May 2007 (UTC)
List of academic articles on algotirhms, NP Complete, literature on 3D versions?
[edit]Is the nesting problem in the extreme of the *absolute* most efficient packing proved NP-Complete? It seems like it would a variant of the Bin packing problem, which is proved NP-hard. Except there is the added constraint of the "bin" being 2-dimensional, and extensible in various ways (depending on the CNC setup. Are there articles on the 3D variant of this problem, that would be applicable in laser sintering (where parts can be independent, and the time is based mostly on the height of the bed rather than the volume (I am guessing here that scanning is quick while stepping the z-axis is what really takes time time.)
Why is there no article contents box on this talk page? Jimw338 (talk) 14:15, 25 July 2019 (UTC)