摘要
提出了一种快速三维散乱数据点重建算法.我们对包围盒算法进行了改进,减少了建立散乱点近邻关系所需的计算量;同时针对位置相对平坦的数据点,结合最小二乘法给出了一种计算法矢的混合方法.实例表明,该算法是有效的.
A fast reconstructing algorithm for three-dimensional scattered data is proposed in this paper. We made improvement of surroundel box algorithm, which reduced thecomputational costs of establishing neighboring relationship of scattered data. Meanwhile, we proposed a mixed method combined with least square algorithm to compute normal derivative for the relative flat data. The proposed algorithm is implemented and numerical results show its efficiency.
出处
《数学的实践与认识》
CSCD
北大核心
2007年第9期58-62,共5页
Mathematics in Practice and Theory
