多边形顶点算法是冲裁排样优化问题的一种新算法。本文在单排顶点算法的基础上，对其它常用排样方式进行了研究，通过对原图形数组的适当拆分和重组构成新的多边形，即可采用在图形内求多边形顶点处宽度的算法。该算法不仅简化了计算，提高了运算速度，而且保证了最优解。 Polygon vertex algorithm is a new algorithm for blanking nesting optimization problem. Based on the single-row vertex algorithm, this paper researches on other commonly used nesting methods. Through the appropriate splitting and reorganization of the original graphics array to form a new polygon, the algorithm can be used to calculate the width of the vertices of polygons in the graphics. The algorithm not only simplifies the calculation, improves the speed of operation, but also guarantees the optimal solution.