具有任意自由度的B样条非均匀细分  

Non-uniform subdivision for B-splines of arbitrary degree

作　　者：孙立镌[1] 刘扬[1] 赵强[1] 

机构地区：[1]哈尔滨理工大学计算机科学与技术学院,哈尔滨150080

出　　处：《计算机应用研究》2011年第5期1972-1974,共3页Application Research of Computers

基　　金：国家自然科学基金资助项目(60173055)

摘　　要：为了便于工程实际应用,非均匀细分方法现在已经成为计算机图形学和几何建模中的热点问题。提出一种具有任意自由度的B样条非均匀细分算法,其实现与B样条均匀细分即Lane-Riesenfeld细分方法相似。该算法包含了非均匀d环结构生成的双重控制点,其中d环相似于d度均匀B样条曲线的Lane-Riesenfeld算法中均匀的d环结构。Lane-Riesenfeld算法是由B样条曲线基函数的连续卷积公式直接得出的,而本算法是blosso-ming方法的一个扩展。对于非均匀B样条曲线来说,该节点插入方法比之前的方法更简单有效。Though Chinese engineers engaged in CAGD,this paper presented an efficient algorithm for subdividing non-uniform B-splines of arbitrary degree in a manner similar to the Lane-Riesenfeld subdivision algorithm for uniform B-splines of arbitrary degree.The algorithm discussed consists of the doubling control points followed by d rounds of non-uniform averaging similar to the d rounds of uniform averaging in the Lane-Riesenfeld algorithm for uniform B-splines of degree d.However,unlike the Lane-Riesenfeld algorithm which followed most directly from the continuous convolution formula for the uniform B-spline basis functions,the algorithm followed naturally from blossoming.For non-uniform B-splines,the result shows that the knot insertion method is simpler and more efficient than previous knot insertion algorithms.

关 键 词：自由度 B样条 非均匀细分 d环 节点插入 

分 类 号：TP391[自动化与计算机技术—计算机应用技术]