基于法矢控制的B样条曲面逼近的PIA方法-计算机系统应用.PDF

计 算 机 系 统 应 用 2015 年 第 24 卷 第 6 期 基于法矢控制的 B 样条曲面逼近的 PIA 方法① 黄丽琴, 潘日晶, 林传銮, 陈 青 (福建师范大学 数学与计算机科学学院, 福州 350007) 摘 要: 提出了一种基于法矢控制的 B 样条曲面逼近的渐进迭代逼近(PIA)算法. 一方面该方法将离散数据点的 切失、曲率、法矢等几何特征充分应用到离散数据点的逼近问题上, 利用数据点两个方向的切矢构造出数据点的 法矢约束来控制逼近曲面形状, 相比于无法矢控制的 B 样条曲面逼近的渐进迭代逼近(PIA)方法, 逼近曲面更光 顺, 可获得更好的逼近效果. 另一方面由于该算法选取主特征点作为控制顶点, 所以允许在曲面拟合中控制顶点 的数目小于数据点的数目. 而且PIA 算法的每次迭代过程中的各个步骤都是独立的, 很容易被应用到并行计算上, 可提高计算效率. 本文还给出了一些实例来验证该算法的有效性. 关键词: 渐进迭代逼近; B 样条曲面; 主特征点; 切矢; 法矢; 调整差向量; 曲率 PIA for B-spline Surface Approximation with Normal Constraint HUANG Li-Qin, PAN Ri-Jing, LIN Chuan-Luan, CHEN Qing (School of Fjian Normal University, Fuzhou 350700, China) Abstract: In this paper, we propose a progressive iterative approximation (PIA) algorithm for B-spline surface approximation with normal constraint. On the one hand, the discrete data points of the tangent vector, normal vector, curvature and other geometric characteristics are fully applied to the approximation problem of discrete data points, using the two directions of the tangent vector to construct normal constraint can avoid unnecessary fluctuations, and obtain better approximation effect. On the other hand, the number of selecting feature points is less than the number of data points, so the PIA algorithm can be used for the approximation of the mass of discrete data points. The steps in the process of each iteration of the algorithm are independent, which is easy to be applied to the parallel computing, which greatly improve the computational efficiency. Some examples are given to show the validity of the algorithm. Key words: progressive iterative approximation; B-spline surface; features points; tangent vector; normal constraint; adjusting vector; curvature 曲面造型是计算机辅助几何设