An improved method for calculating the no-fit polygon
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. Feasible locations are required for most of the solutions to two-dimensional packing problems, and also for other problems such as robot motion planning. Efficient methods to calculate the NFP of two convex polygons, or one convex and one non-convex polygon have been developed by other researchers. However, when both polygons are non-convex, the current methods of calculation are inefficient or difficult to implement. This paper presents an extension of Ghosh's (CVGIP: Image Understanding 54(1991)119) NFP algorithm, and uses manipulation of sorted lists of polygon edges to find the NFP efficiently.
no-fit polygon two-dimensional packing minkowski sum