冲裁件优化排样类多边形顶点算法的研究

Research on algorithm to apex of polygon when layout stampings optimally

多边形顶点算法是冲裁件优化排样的一种新算法。本文借鉴单排多边形顶点算法的思想，对其他排样方式进行了研究，通过对相邻图形存储数组的拆分和重组，形成虚拟内、外多边形，给出了类多边形顶点算法。该算法在简化计算的基础上，提高了程序运行速度，并保证得到最优解。

Abstract The algorithm to apex of polygon is a new one when layout stampings optimally.With the aid of image of algorithm to apex of polygon with single row,make study on other layout. By separating and recombining storage number group of adjacent graphs,to form virtual inner and outer polygons and give out algorithm to apex of polygon. Based on short cut calculation,this method can improve operating speed of program and ensure optimal result.