摘要
RomaniL.等人在2004年首次明确提出了任意阶均匀B样条和Bezier曲线之间相互转换矩阵的计算方法,但该方法把高阶的转换矩阵用递归降阶形式定义的,在每次降阶中存在大量的重复计算,针对这个问题提出了改进的算法,并给出了其在均匀B样条的降阶方面的应用实例。
Romani L. firstly put forward clearly in 2004 the matrix algorithm of mutual conversion between uniform B-spline of arbitrary order and Bezier curves. But the recursive order reduction formula was applied to define higher order conversion matrix in the algorithm, so a lot of redundancy computing exists in every order reduction. In this paper we propose an improved method against this problem, and provide a real application example in order reduction for uniform B-spline.
出处
《计算机应用与软件》
CSCD
北大核心
2008年第7期91-93,共3页
Computer Applications and Software
基金
江西省教育厅科技计划资助(2006[36])
