首页 | 本学科首页   官方微博 | 高级检索  
     检索      

离散点列的局部双圆弧逼近
引用本文:徐建明,刘飞,何援军,蔡鸿明.离散点列的局部双圆弧逼近[J].东华大学学报(自然科学版),2005,31(4):62-65.
作者姓名:徐建明  刘飞  何援军  蔡鸿明
作者单位:1. 上海交通大学计算机科学与工程系,上海,200030
2. 上海交通大学计算机科学与工程系,上海,200030;上海市长乐-霍尔姆斯职业学校,上海,200432
3. 上海交通大学软件学院,上海,200030
基金项目:国家863计划项目资助(2002AA411420)
摘    要:给出一种用双圆弧逼近离散点列的算法,该方法对数据点列没有任何限定性要求。先对离散点列用三次样条曲线插值,求出型值点的一阶导数,然后对三次样条曲线用双圆弧逼近。由于采用局部双圆弧逼近,该算法对大挠度和小挠度样条曲线均适用,从而克服了传统双圆弧逼近只能针对小挠度样条曲线的缺点。实验表明,该算法稳定、健壮,且能保持曲线的整体光滑,达到C^1连续。

关 键 词:双圆弧  逼近  三次样条  离散点列
收稿时间:2004-12-15
修稿时间:2004年12月15

Approximation of Discrete Points by Biarc Curve
XU Jian-ming,LIU Fei,He Yuan-jun,Cai Hong-ming.Approximation of Discrete Points by Biarc Curve[J].Journal of Donghua University,2005,31(4):62-65.
Authors:XU Jian-ming  LIU Fei  He Yuan-jun  Cai Hong-ming
Abstract:An algorithm of approximation of discrete points by biarc curve is presented. The algorithm has no special requirements for the discrete points. It first approximates the discrete points by cubic spline and gets the first derivative of the given discrete points, then approximates the cubic spline by biarc curve. Through local approximation, the algorithm is applicable to both large deflection spline and small deflection ones. It overcomes the disadvantage of traditional biarc spline which are only applicable to small deflection spline. The algorithm is stable and robust. The acquired biarc curve is globally smooth and C^1 continuous.
Keywords:biarc curve  approximation  spline
本文献已被 CNKI 维普 万方数据 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号