检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
作 者:董光雷[1] 戴宁[1] 杨峰[1] 韩厚年[1] 郭保苏[1] 王勇[2] 吕培军[2]
机构地区:[1]南京航空航天大学,南京210016 [2]北京大学口腔医学院,北京100081
出 处:《中国机械工程》2012年第16期1896-1902,共7页China Mechanical Engineering
基 金:国家科技支撑计划资助项目(2009BAI81B02);江苏省卫生厅医学科研项目(H201034);江苏省"六大人才"高峰项目(2010-WS081)
摘 要:在口腔修复体数控粗加工中环切走刀方式应用广泛,为了减少加工时刀具跳刀次数以缩短空走刀时间和优化刀轨环之间的过渡连接,提出了基于单根树结构的环切刀轨无跳刀过渡连接算法。在该算法中,根据刀轨环计算过程中建立的父子关系构建刀轨环树,然后对刀轨环树拓扑分解实现刀轨环编组,编组环集合中具有父子关系的刀轨环之间通过"过渡点对"构建过渡连接关系,最后遍历刀轨环树获得无跳刀刀轨。实验表明,该算法无跳刀,无重复切削,满足实际加工要求。Contour-parallel offset (CPO) tool path was used widely in the rough machining process for dental restoration. In order to minimize the number of tool--retractions which did not con- tribute to the actual cutting and optimize the links between tool path loops(TPLs), a CPO tool path linking algorithm based on single root TPLs tree data structure was presented. With the parent/child relationship built during the calculation of TPLs, a single root TPLs tree was constructed, and then it was divided into many subtrees according its topology, as a result all TPLs were split into several grouped TPLs. TPLs in each group were linked by linking point pairs. Finally, a CPO tool path with- out tool-retraction can be generated by traveling TPLs tree. Several testing results show that this method can obtain CPO tool path without tool--retraction effectively.
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:216.73.216.222