Nesting algorithm - Revision history

Klbrain: Closing marge merge proposal; uncontested objection and no support; see Talk:Packing problems#Proposed merge with Nesting algorithm

2025-04-02T16:47:54Z

Closing marge merge proposal; uncontested objection and no support; see Talk:Packing problems#Proposed merge with Nesting algorithm

← Previous revision		Revision as of 16:47, 2 April 2025
Line 1:		Line 1:
	{{Short description\|Optimizing algorithm}}		{{Short description\|Optimizing algorithm}}
	{{mergeto\|Packing problems\|date=March 2025}}
	{{refimprove\|date=September 2015}}		{{refimprove\|date=September 2015}}
	[[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]]

AnomieBOT: Dating maintenance tags: {{Mergeto}}

2025-03-05T11:27:18Z

Dating maintenance tags: {{Mergeto}}

← Previous revision		Revision as of 11:27, 5 March 2025
Line 1:		Line 1:
	{{Short description\|Optimizing algorithm}}		{{Short description\|Optimizing algorithm}}
	{{mergeto\|Packing problems}}		{{mergeto\|Packing problems\|date=March 2025}}
	{{refimprove\|date=September 2015}}		{{refimprove\|date=September 2015}}
	[[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]]

The Anome: {{mergeto|Packing problems}}

2025-03-05T11:06:54Z

← Previous revision		Revision as of 11:06, 5 March 2025
Line 1:		Line 1:
	{{Short description\|Optimizing algorithm}}		{{Short description\|Optimizing algorithm}}
			{{mergeto\|Packing problems}}
	{{refimprove\|date=September 2015}}		{{refimprove\|date=September 2015}}
	[[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]]

Tc14Hd: Added short description

2024-10-24T17:16:44Z

Added short description

← Previous revision		Revision as of 17:16, 24 October 2024
Line 1:		Line 1:
			{{Short description\|Optimizing algorithm}}
	{{refimprove\|date=September 2015}}		{{refimprove\|date=September 2015}}
	[[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]]

Bert.Roos: Described "trying out different options through recursion" as an example rather than the only valid approach

2024-07-10T11:59:59Z

Described "trying out different options through recursion" as an example rather than the only valid approach

← Previous revision		Revision as of 11:59, 10 July 2024
Line 1:		Line 1:
	{{refimprove\|date=September 2015}}		{{refimprove\|date=September 2015}}
	[[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 [[Nesting (process)\|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. This could for instance be done 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.

JoeNMLC: Successfully de-orphaned!♦ Wikiproject Orphanage: You can help!♦

2023-02-08T20:25:08Z

Successfully de-orphaned!♦ Wikiproject Orphanage: You can help!♦

← Previous revision		Revision as of 20:25, 8 February 2023
Line 1:		Line 1:
	{{Orphan\|date=February 2013}}
	{{refimprove\|date=September 2015}}		{{refimprove\|date=September 2015}}

	[[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 [[Nesting (process)\|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]].

Bjornte: link to nesting process

2022-11-11T08:18:11Z

link to nesting process

← Previous revision		Revision as of 08:18, 11 November 2022
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.

Cewbot: Normalize {{Multiple issues}}: Remove {{Multiple issues}} for only 1 maintenance template(s): Refimprove

2020-05-31T02:08:41Z

Normalize {{Multiple issues}}: Remove {{Multiple issues}} for only 1 maintenance template(s): Refimprove

← Previous revision		Revision as of 02:08, 31 May 2020
Line 1:		Line 1:
	{{multiple issues\|
	{{Orphan\|date=February 2013}}		{{Orphan\|date=February 2013}}
	{{refimprove\|date=September 2015}}		{{refimprove\|date=September 2015}}
	}}

	[[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]]

Varnent: clean up per WP:CHECKWIKI using AWB

2015-09-17T05:21:32Z

clean up per WP:CHECKWIKI using AWB

← Previous revision		Revision as of 05:21, 17 September 2015
Line 1:		Line 1:
	{{multiple issues\|		{{multiple issues\|
	{{Orphan\|date=February 2013}}		{{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>		<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==		==References==
	{{Reflist}}		{{Reflist}}

BG19bot: WP:CHECKWIKI error fix for #03. Missing Reflist. Do general fixes if a problem exists. - using AWB (11377)

2015-08-30T06:55:25Z

WP:CHECKWIKI error fix for #03. Missing Reflist. Do general fixes if a problem exists. - using AWB (11377)

← Previous revision		Revision as of 06:55, 30 August 2015
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.

		⚫	<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}}

	[[Category:Geometric algorithms]]		[[Category:Geometric algorithms]]
Line 15:		Line 19:

	{{science-software-stub}}		{{science-software-stub}}
⚫	<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>

← Previous revision		Revision as of 16:47, 2 April 2025
Line 1:		Line 1:
	{{Short description\|Optimizing algorithm}}		{{Short description\|Optimizing algorithm}}
	{{mergeto\|Packing problems\|date=March 2025}}
	{{refimprove\|date=September 2015}}		{{refimprove\|date=September 2015}}
	[[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]]

← Previous revision		Revision as of 11:27, 5 March 2025
Line 1:		Line 1:
	{{Short description\|Optimizing algorithm}}		{{Short description\|Optimizing algorithm}}
	{{mergeto\|Packing problems}}		{{mergeto\|Packing problems\|date=March 2025}}
	{{refimprove\|date=September 2015}}		{{refimprove\|date=September 2015}}
	[[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]]

← Previous revision		Revision as of 11:06, 5 March 2025
Line 1:		Line 1:
	{{Short description\|Optimizing algorithm}}		{{Short description\|Optimizing algorithm}}
			{{mergeto\|Packing problems}}
	{{refimprove\|date=September 2015}}		{{refimprove\|date=September 2015}}
	[[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]]

← Previous revision		Revision as of 17:16, 24 October 2024
Line 1:		Line 1:
			{{Short description\|Optimizing algorithm}}
	{{refimprove\|date=September 2015}}		{{refimprove\|date=September 2015}}
	[[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]]

← Previous revision		Revision as of 20:25, 8 February 2023
Line 1:		Line 1:
	{{Orphan\|date=February 2013}}
	{{refimprove\|date=September 2015}}		{{refimprove\|date=September 2015}}

	[[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 [[Nesting (process)\|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]].