摘要
多边形顶点算法是冲裁排样优化问题的一种新算法。本文在单排顶点算法的基础上，对其它常用排样方式进行了研究，通过对原图形数组的适当拆分和重组构成新的多边形，即可采用在图形内求多边形顶点处宽度的算法。该算法不仅简化了计算，提高了运算速度，而且保证了最优解。
A polygon vertex algorithm is a new optimizing method of blanking layout. In this paper, other conventional layouts are also studied based on the single line layout method.It is available to calculate the width of the vertexes within new polygons,when those are formed through proper separating and rebuilding the array of the original polygons. This method not only simplifies the calculation and raises the speed of operation, but also guarantee the optimization result.
出处
《太原重型机械学院学报》
1997年第3期269-273,282,共6页
Journal of Taiyuan Heavy Machinery Institute
