{
  "id": "nesting-algorithm-1850711-10ba574a2062169f",
  "slug": "nesting-algorithm",
  "title": "Nesting algorithm",
  "qid": "Q17042063",
  "lead": "Nesting algorithms are used to make the most efficient use of material or space. This could for instance be done 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. #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.",
  "body": "Nesting algorithms are used to make the most efficient use of material or space. This could for instance be done 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. 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==",
  "categories": [
    "20477111",
    "22986271",
    "23118434",
    "23468805",
    "23603337",
    "24043274",
    "28699186"
  ],
  "license": "CC BY-SA 4.0",
  "source_uri": "https://en.wikipedia.org/w/index.php?oldid=1283620045",
  "content_hash": "10ba574a2062169feba7268e7ba24c0347919811b29eb3a1cb83b3d70fcffe11",
  "created_at": 1792316709.7576663,
  "updated_at": 1743605274.0,
  "claims": [],
  "contradictions": [],
  "confidence": 0.6,
  "csl": {
    "id": "nesting-algorithm-1850711-10ba574a2062169f",
    "type": "webpage",
    "title": "Nesting algorithm",
    "author": [
      {
        "family": "Anticloud FZ LLE",
        "literal": "Anticloud FZ LLE"
      }
    ],
    "container-title": "encyclopegia.org",
    "publisher": "Anticloud FZ LLE",
    "publisher-place": "Dubai, United Arab Emirates",
    "URL": "https://encyclopegia.org/a/nesting-algorithm",
    "issued": {
      "date-parts": [
        [
          2026,
          10,
          18
        ]
      ]
    },
    "accessed": {
      "date-parts": [
        [
          2026,
          11,
          12
        ]
      ]
    },
    "license": "CC BY-SA 4.0",
    "DOI": "eo1:nesting-algorithm-1850711-10ba574a2062169f",
    "isBasedOn": "https://en.wikipedia.org/w/index.php?oldid=1283620045",
    "note": "Immutable snapshot nesting-algorithm-1850711-10ba574a2062169f, content root 10ba574a2062169f…"
  }
}