Research And Development Of The Algorithm For Contour-Parallel Tool-Path Planning Based On SV

Now CAD/CAM system is indispensable to the manufacturing industry, and its level of development represents the modernization of the national manufacturing sector. But at present, most domestic and foreign businesses are using foreign CAD/ CAM system, which almost monopolied by a few large companies such as Pro/E, UG and so on. To break this situation and develop China's own CAD/CAM systems, many scientific research institutes and companies supported by the state invested a lot of manpower and material resources to carry out the CAD/CAM system technology research and development, and it also formed a series of related technologies and products one of which is an SV software system of the Shandong Huatian Alexander,it has developed a number of large and medium enterprises in China.the SV software system has been successfully applied,But the system in four or five-axis NC machining functions need to be further improved, this is also research field of this paper.The paper study the way of pocket machining,the machining region profiles are obtained and then put them into quasilinearization,after linearization,it is made up of polygons,and then establish the internal and external contour loops and the ring relational tree,then traversing the ring relational tree to get the machining region. Practice has proved that the algorithm is applicable to arbitrary complex multi-cavity region for processing.Pocket machining along the contour is a common method for the NC machining,to get Contour-Parallel Tool-Path, offsetting the contour is an important and complex task. In this paper, an offset along the angle bisector algorithm.is put forward. After using this method, you can get a non-interference offset ring.For single ring region,the offset of the contour may be have local self-intersection problem.for multi-ring region, the intersection problem is also among many offset rings,to avoid overcut, therefore,it needs reconstruction of the milling area, this paper proposes a region based on the processing chain reconstruction algorithm that can solve complex machining area reconstruction. In order to provide machining efficiency, reduce the number of advance and retreat knife, reduce duplication of machining rates, the need for machining routes and cutter location optimization. This paper presents a method of shortest distance route planning. The main principle of this algorithm is to establish the relational tree among the offseting rings, from the outside (or innermost) ring of a point on the traverse, traverse to the first point, to strike with the ring on the ring adjacent to the initial point point the shortest distance, from the point of departure, traversing the adjacent ring. Repeat this process until all the rings to be traversed. The order of the traversal order is cutter location path.All the algorithms in this paper have been embedded in the SV system, and a tire mold plant in the actual processing, compare the results achieved from the SV system with the international mainstream CAD/CAM system, the effect the same.