No Fit Polygon and Nesting
Cutting and packing problems which involves the placement of irregular shapes known as templates on to a surface has been a problem variant with a wide variety of industrial applications. The process of arranging a set of plane irregularly shaped on a plane irregularly shaped surface, such that no parts overlap and as much of the surface is covered as possible.
The concept of NFP (No Fit Polygon) was proposed by Art, Adamowcz and Albano. No Fit Polygon (NFP) is the fundamental geometric tool for 2D irregular nesting problems. It gives the set of non-overlapping placements for polygons. NFP can be defined as below:
“The no-fit polygon (NFP) is the set of feasible locations that one polygon may take with respect to another polygon, such that the polygons do not overlap.”
Many approaches and techniques have been mentioned in many research papers each having certain limitations, the approach used here is quite much the new approach mentioned in a few researches works for all three cases
Calculating No Fit Polygon in all these cases is mentioned case by case below: