欢迎访问《图学学报》 分享到:

图学学报

• 计算机图形学 • 上一篇    下一篇

一种新的基于参考曲线的 B 样条曲线延拓算法

  

  1. 1. 河北工业大学理学院,天津 300401;
    2. 河北工业大学机械工程学院,天津 300130
  • 出版日期:2018-10-31 发布日期:2018-11-16
  • 基金资助:
    国家自然科学基金项目(U1433117)

A New Algorithm for Extending B-Spline Curve with a Reference Curve

  1. 1. School of Science, Hebei University of Technology, Tianjin 300401, China; 
    2. School of Mechanical Engineering, Hebei University of Technology, Tianjin 300130, China
  • Online:2018-10-31 Published:2018-11-16

摘要: 针对计算机辅助几何设计(CAGD)中 B 样条曲线延拓问题提出了一种新的算法, 可以使延拓后的曲线和给定的参考曲线形状尽量相似。首先通过统一待延拓曲线和参考曲线的 节点矢量来确定延拓后曲线的节点矢量;然后,利用 B 样条端点松弛算法确定延拓后曲线中和 原曲线对应的控制顶点;最后,通过优化方法确定新增加的控制顶点,优化的目标是经仿射变 换后的参考曲线和延拓后的曲线对应控制顶点之间距离的平方和最小。提出了一种两步法求解 该优化问题,先通过优化方法确定仿射变换,然后利用该仿射变换计算新增加的控制顶点。为 了使延拓后的曲线光顺性较好,通过引入光顺项对该算法进行了进一步的改进。实验结果表明, 该算法得到的延拓曲线和参考曲线形状具有一定的相似性,算法具有很好的实用性和灵活性。

关键词: B 样条曲线, 曲线延拓, 相似性, 仿射变换, 最优化

Abstract: For the problem of B-spline curve extension in computer aided geometric design (CAGD), a new algorithm is proposed such that the extended curve is similar to a given reference curve in shape. Firstly, the knot vector of the extended curve is determined by unifying the knot vector of the original curve and that of the reference curve. Secondly, the control vertices corresponding to the original curve are determined with B-spline unclamping algorithm. Finally, the new control vertices are determined with optimization method. The aim is to minimize the sum of squared distances between the control vertices of affine transformed reference curve and those of the extended curve. A two-stage algorithm is presented to solve this optimization problem. At the first stage, the affine transformation is determined with optimization method. And at the second stage, the new control vertices are calculated by applying the affine transformation. As a further improvement to the algorithm, a smoothing term is introduced at the second stage to make the extended curve smoother. Experimental results show that the extended curve by the proposed algorithm has similar shape to the reference curve to some extent, and the algorithm is practical and flexible.

Key words: B-spline curve, curve extension, similarity, affine transformation, optimization