基于Voronoi图理论的最优刀具轨迹规划算法的研究

The Algorithm of Optimal Cutting Tool Path Planning Based on the Theory of Voronoi Diagram

基于面向对象的Voronoi图理论 ,研究了整齐等距线与Voronoi多边形的交点存在性问题及在有瓶颈的情况下交点个数的判别定理 ,并根据交点状态变换 (IST)规则 ,应用三种堆栈 (Tstack ,Istack和Pstack) ,以线性的时间复杂度实现了整齐等距线的生成和型腔加工的最优刀具轨迹规划算法。该算法已成功地应用于NC加工中。

WT5BZ]In order to have the cutting tool complete the specific pocket machining efficiently within given boundaries, the existence problem of the intersection between the trimmed offset and Voronoi polygon based on the object oriented Voronoi diagram theory were studied. At the same time, the intersection number determination lemma is also studied in this paper with bottleneck. According to the intersection state transition rule, we present the offset generating and the optimal tool path planning algorithm for pocket machining in linear time with three stacks: Tstack,Istack and Pstack. The above algorithms have been applied to NC machining successfully. And the feasibility and efficiency are fully verified.