摘要
提出的算法是根据比较两环顶点最大坐标值的位置 ,以及计算通过其中一个环的最大坐标点所作的射线与另一环的交点数目来确定两环的位置关系。在此基础上建立树状数据结构 ,确定环的拓扑关系 ,从而确定加工区域。
This paper proposes an algorithm which determines the location relationship beween two loops in plane pockets by comparing the maximum coordinate values of the vertices in the two loops and calculating the number of intersectional points which lie on the radial line from one maximum vertex to the other loop. The topological relation of the loops can also be determined by setting up tree structure and then the cutting area can be decided on.
出处
《江南学院学报》
2001年第4期15-18,27,共5页
Journal of Jiangnan College
