论文部分内容阅读
基于面向对象的Voronoi图理论 ,研究了整齐等距线与Voronoi多边形的交点存在性问题及在有瓶颈的情况下交点个数的判别定理 ,并根据交点状态变换 (IST)规则 ,应用三种堆栈 (Tstack ,Istack和Pstack) ,以线性的时间复杂度实现了整齐等距线的生成和型腔加工的最优刀具轨迹规划算法。该算法已成功地应用于NC加工中。
Based on the object-oriented Voronoi diagram theory, the existence of intersections between neat equidistant lines and Voronoi polygons and the discriminant theorem of the number of intersections in the case of bottleneck are studied. According to the Intersection State Transition (IST) rules, three kinds of stacks (Tstack, Istack, and Pstack) to achieve a neat equidistant line generation and an optimal tool path planning algorithm for pocket machining with linear time complexity. The algorithm has been successfully used in NC machining.