检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
作 者:孙殿柱[1] 康新才[1] 孙永伟[1] 李延瑞[1]
机构地区:[1]山东理工大学机械工程学院,山东淄博255091
出 处:《北京工业大学学报》2012年第10期1446-1450,共5页Journal of Beijing University of Technology
基 金:国家自然科学基金资助项目(51075247)
摘 要:提出一种三角Bézier曲面刀轨快速生成算法,该算法引入R*S树构建三角Bézier曲面的动态索引结构,基于此结构快速、准确获取相交的三角Bézier曲面片集,依据所设精度阈值将其自适应离散为三角网格,通过对刀轨截平面与离散后三角网格求交获取交线,进而迭代计算交线各端点在三角Bézier曲面上的近曲面点,并将近曲面点作为刀触点,沿其所在曲面法矢偏置获取刀位点并进行干涉点处理,顺次连接各刀位点生成三角Bézier曲面数控加工刀轨.实例证明该算法可快速、准确获取复杂三角Bézier曲面数控加工刀轨。An algorithm of rapidly generating tool path based on triangular Bézier surface is proposed.R*S tree is used to locate the sets of intersection triangular Bézier patches rapidly and exactly.Then each patch is adaptively subdivided into many triangular patches according to the given precision.The intersection line segments are acquired through intersection of triangular mesh and cutter cutting plane,and the near-surface point of each endpoint on the intersection curves is obtained by the iterative calculation method.Considerating interferential points,the cutter location points are obtained through the offset of near-surface points.Then,the cutter location points are connected one by one to generate the tool path.Examples show that the NC tool-path for the intricate triangular Bézier surface can be accurately and efficiently obtained through this algorithm.
关 键 词:三角BÉZIER曲面 R*S树 自适应离散 刀触点 数控刀轨
分 类 号:TP391.73[自动化与计算机技术—计算机应用技术]
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:216.73.216.15