Nesting algorithms

From Wikipedia, the free encyclopedia

Nesting Algorithms are used to make the most efficient use of material or space by evaluating many different possible combinations via Recursion.


  • 1. 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.

  • 2. 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.

  • 3. 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.

Image:NestingTypes01.jpg



Some factors worth considering when comparing...
  • Linear (1-dimensional) cut combinations:
  • Kerf
  • Scrap or drop length
  • Cost or preference of source material
  • Plate (2-dimensional) cut combinations:
  • Kerf
  • Area, shape, and useability of resulting scrap or drop
  • Cost or preference of source material
  • Number of cuts required
  • Density (Yield Area / Cut Bounding Box)
    i.e. If a combination consists of only two rectangular 1x2' cuts, placing them parallel results in a higher density than placing them in a T or L shape.
Advanced Search
Included Web Search Engines


Safe Search

close

Top Matching Results

Occasionally Search.com will highlight specialized results that are based on the context of your query. Examples of specialized results include specific links to news, images, or video.

Top Matching Results may highlight information from other Search.com pages, content from the CNET Network of sites, or third party content. The listings are based purely on relevance. Search.com does not receive payment for listings in this section but our partners that provide this data may get paid for listing these products.

Sponsored Links

This section contains paid listings which have been purchased by companies that want to have their sites appear for specific search terms and related content. These listings are administered, sorted and maintained by a third party and are not endorsed by Search.com.

Search Results

Search.com sends your search query to several search engines at one time and integrates the results into one list which has been sorted by relevance using Search.com's proprietary algorithm. You can customize the list of search engines included in your metasearch from the preferences.

The search engines that are used in your metasearch may allow companies to pay to have their Web sites included within the results. To view the Paid Inclusion policy for a specific search engine, please visit their Web site. Search.com does not accept payment or share revenue with any search engine partner for listings in this section.