检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
机构地区:[1]浙江大学数学系,浙江杭州310027 [2]浙江工业大学数学系,浙江杭州310032
出 处:《浙江大学学报(工学版)》2009年第6期1020-1025,1171,共7页Journal of Zhejiang University:Engineering Science
基 金:国家"973"重点基础研究资助项目(2004CB719400);国家自然科学基金资助项目(60673031);浙江省教育厅科研项目(20070309);浙江省自然科学基金资助项目(Y107311)
摘 要:针对有理曲线多项式Hybrid逼近未必收敛及计算较繁的局限性,给出了以原有理Bézier曲线之升阶曲线的控制顶点为顶点的多项式Bézier曲线,来逼近原有理曲线的一类简单逼近方法.与此同时,为追求较高逼近速度,导出了有理Bézier曲线多项式逼近的一个矛盾方程组,并进一步基于广义逆矩阵理论,给出了其用矩阵表示的最小二乘解.最后借助以原有理曲线权因子为Bézier纵标的多项式的升阶,使得多项式逼近的曲线次数保持不变的同时大幅度提高了逼近精度.In order to resolve the problem that hybrid polynomial approximation cannot guarantee the property of convergence, a simple approximation method was given which used the polynomial Bézier curve whose points are the control points of the degree-elevated curve to approximate the original rational curve. Meanwhile, the contradictory equations of precise approximating rational curve by polynomial curve were deduced to achieve higher approximation efficiency. Then based on the theory of generalized inverse matrix, the least square solution in matrix form was obtained. Combined with the degree elevation of the function which took the weights of the original rational curve as Bézier lengths, the new way got better approximating result with less error with the same approximating degree.
关 键 词:计算机辅助几何设计 有理BÉZIER曲线 多项式逼近 升阶
分 类 号:TP391.72[自动化与计算机技术—计算机应用技术]
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:216.73.216.217