Research On Slicing Algorithm And Path Planning Method Of Wire And Arc Additive Manufacturing

As one of the most important branches of additive manufacturing for metal parts,Wire and Arc Additive Manufacturing(WAAM)has been widely concerned for its high flexibility and high efficiency.WAAM is based on welding technology,which melts metal wires layer by layer according to the given path until the part is built up.The existing data processing methods for additive manufacturing can not suit the needs of WAAM due to the particularity of the welding procedure,so it is significant to develop specific data processing algorithms.The dissertation concentrates on the key algorithms for data processing of WAAM technique,and gives an implement of a comprehensive application.The main works done by the dissertation are as follows:(1)For the problem of data redundancy and the lack of topology in STL files,a topology reconstruction algorithm based on hash searching is designed.This algorithm removes redundant vertexs quickly through an appropriate hash function,which has been proved to be well-behaved by multiple experiments.Compared with other existing algorithms,it has been demonstrated that the algorithm shows better performance in efficiency.(2)In the dissertation,an improved slicing algorithm is proposed to deal with the inefficiency of other slicing methods.The algorithm builds integral topology of STL models in advance,and then reduces the search range in slicing by establishing the slicing relation matrix,which can effectively reduce the time cost of slicing.In the meantime,the algorithm has the ability to distinguish outer and inner contours automaticly,which enables to get oriented contours directly and simplifies the subsequent data processing.The method is proved to be effective and efficient through application cases,and the results show better performance than other existing algorithms,especially when the STL model is complex or large.(3)In consideration of the characteristics of welding procedure,the dissertation gives a path planning method that combines contour path and zigzag path.This method fills areas near the surface with contour path to keep the forming accuracy,and fills internal region with continous zigzag path.The dissertation studies on the generation method of zigzag path,and implements an automatic partitioning algorithm,which reduces the frequency of arcing and arc breaking.The algorithm finally generates CLI files,and it has been proved to be correct and feasible by simulation.(4)Using the methods above,the programming of data processing software has been accomplished in the programing environment of Visual C++ with the support of Open GL library,and then introduces the processing flow of the software with examples.