| 注册
首页|期刊导航|计算机工程与科学|基于四次B样条的曲线逼近算法

基于四次B样条的曲线逼近算法

陈涵宇 蒋勇

计算机工程与科学2017,Vol.39Issue(8):1489-1494,6.
计算机工程与科学2017,Vol.39Issue(8):1489-1494,6.DOI:10.3969/j.issn.1007-130X.2017.08.016

基于四次B样条的曲线逼近算法

An approximate algorithm based on quartic B-spline curves

陈涵宇 1蒋勇1

作者信息

  • 1. 南京信息工程大学数学与统计学院,江苏南京210044
  • 折叠

摘要

Abstract

To overcome the shortcomings of the traditional interpolation spline that is difficult to add or delete points and the inaccuracy of the traditional approximate spline,we propose an approximate algorithm based on the cubic B-spline.The algorithm,which is based on the approximation and the iteration,improves the calculation speed and precision.Based on the periodic cubic B-spline curves,the algorithm extends to quartic B-spline,which is third derivative.Besides,the theoretical proof of the convergence of the algorithm is given out.Finally,the numerical approximation experiments on common functions show that the algorithm has a faster convergence speed and can meet higher practical industrial needs.

关键词

逼近算法/四次B样条/收敛性/曲线/迭代

Key words

approximate algorithm/quartic B-spline/convergence/curve/iteration

分类

数理科学

引用本文复制引用

陈涵宇,蒋勇..基于四次B样条的曲线逼近算法[J].计算机工程与科学,2017,39(8):1489-1494,6.

基金项目

国家自然科学基金(41174165) (41174165)

国家公益性行业专项(GYHY201306073) (GYHY201306073)

计算机工程与科学

OA北大核心CSCDCSTPCD

1007-130X

访问量1
|
下载量0
段落导航相关论文