计算点到曲面最短距离的网格法  

Grid algorithm for calculating the shortest distance from spatial point to free-form surface

作　　者：徐汝锋[1] 陈志同[1] 陈五一[1] 

机构地区：[1]北京航空航天大学机械工程及自动化学院,北京100191

出　　处：《计算机集成制造系统》2011年第1期95-100,共6页Computer Integrated Manufacturing Systems

基　　金：国家自然科学基金资助项目(50875012);国家863计划资助项目(2008AA04Z124);国家科技重大专项资助项目(2009ZX04001-141)~~

摘　　要：为提高最短距离计算的精度、效率和稳定性,提出了一种计算点到曲面最短距离的网格法。该方法首先利用曲面上给定的一点作为初始点,以该点为中心按给定步长将曲面划分为四个网格区域;然后分别计算空间点与初始点以及四个网格中心的距离,选取其中最小的距离作为最短距离,并得到相应网格中心;最后以该中心作为初始点,步长减半,重复以上步骤,从而获得满足一定精度的最短距离。分别以两个复杂曲面为计算实例,通过对所提方法与其他方法的计算结果进行比较,验证了该方法的有效性。To improve the accuracy,efficiency,and reliability of calculating the shortest distance,a grid algorithm for calculating the shortest distance from a spatial point to a free-form surface was presented.First of all,four grid areas were created in the vicinity of a proper initial point on the surface under the given step length.The distances from a spatial point to the initial point and the centers of four grid areas were then calculated,the minimum value among which was selected as the shortest distance,and the corresponding surface point was obtained.Finally,this point was selected as the next initial point,and the step length became a half.The above process was iterated until the accuracy of the shortest distance reached the given value.The proposed algorithm was compared to some existing algorithms under two example surfaces.Results showed the effectiveness of this method.

关 键 词：最短距离 曲面 网格 五坐标 加工 干涉检查 

分 类 号：TP391[自动化与计算机技术—计算机应用技术]