Areas In The Selective Laser Melting Application
This paper researched the practical generation of Voronoi diagrams for multiply-connected planar areas bounded by line segments. The core of the algorithm was on calculating Voronoi polygon of every Voronoi object in planar areas independently. The main approach had two steps. The first step was calculating all relevant bisectors of every Voronoi object. The second one was combining obtained bisectors into completed Voronoi polygons individually. The contents of both steps were very important and all code was implemented in Visual C++ platform. The resulting code was extensively tested on real-world data. Its practical running time seems to grow only linearly. Three statistical CPU-consumption charts had been drawn with the Voronoi diagrams computation data. The CPU-time consumptions records also compared with other published codes for computing Voronoi diagrams very favorably. In particular, it clearly showed that the implementation has high reliable characters in the calculation of the Voronoi diagrams for multi-connected planar areas. And the algorithm was applied to compute offsetting of slice area consisting of large-scale line segments for the selective laser melting (SLM) trajectory scanning technology which is a kind of rapid prototyping (RP). The method of this algorithm was used on the topological structures of all Voronoi edges and Voronoi objects in the calculated Voronoi diagram. The experimental results of offsetting for slice area based on Voronoi diagrams showed that the approach was effective and simple for polygon offsetting problems. The method was helpful to those offsetting work and could provide more effective offsetting solution.
Voronoi diagram selective laser melting planar areas CAD/CAM offsetting algorithm
Qian Bo Zhang Li-Chao Shi Yu-Sheng Liu Bing
State Key Laboratory of Material Processing and Die & Mould Technology of Huazhong University of Science and Technology, Wuhan, China, 430074
国际会议
北京
英文
374-380
2008-11-06（万方平台首次上网日期，不代表论文的发表时间）