一种新的快速求解NFP的方法

A Quick Method for Finding NFP

本文提出计算机优化排样中使用的一种新的快速求解NFP的方法。方法适用于任意凸的或凹的不规则多边形,不需要进行多边形的重叠测试。同需要进行多边形重叠测试的方法相比,本文提出的方法一般可减少计算时间20％～50％,程序代码约减少30％。

This paper presents a quick method to find the NFP which is used in computer optimal layout. It can be applied to irregular polygons whether convex or concave. Furthermore, it is not necessary to carry out overlapping test. Compared with those methods involving the overlapping test, the computing time needed by this method can decrease by 20％～ 50％ and the size of program code by 30％.