A Go-Between Polygonal Vertices Algorithm for the Optimal Layout System in Blanking

An optimal layout algorithm in blanking is given. Based on the algorithm for the apex of polygon in a single row, a go-between polygonal vertices algorithm is presented for an optimal layout in the form of double row layout, opposite single row layout and opposite double row layout. Practical tests showed that lacking in generality of the algorithm for the apex of polygons is overcome by the go-between polygonal vertices algorithm. The optimal layout in blanking can be obtained efficiently and correctly. And an optimal layout system for blanking has been developed on AutoCAD2000 by ObjectARX2000. The material utilization factor has been improved by 10 percent than with the original layout.