Jump to content

Nesting algorithm

From Wikipedia, the free encyclopedia
This is an old revision of this page, as edited by Kayputk (talk | contribs) at 02:50, 9 January 2007. The present address (URL) is a permanent link to this revision, which may differ significantly from the current revision.

Nesting Algorithms are algorithms used to make the most effecient use of material or space by evaluating many different possible combinations. This can be done with Recursion.

Illustrated below are three examples of nesting: 1. Linear (1-dimensional) 2. Plate (2-dimensional) 3. Packing (3-dimensional)