Solved rectangle´s NFP by polygon segmentation

Provide a utilising concave vertex to divided layout polygon for solving rectangle NFP problem. The convexity and concavity of polygon vertices was determined by their coordinates, then divide layout polygon into different feasible regions by concave vertex´s edges and the unfeasible region will be deleted, offset the feasible region´s vertex and gain the rectangle NFP. This method can be used for rectangle layout problem easily and directly. It is simple and efficient by analysis and some examples test and it has wide application in theory and practice.