计算机应用研究2011，Vol.28Issue(5)：1972-1974,3.DOI:10.3969/j.issn.1001-3695.2011.05.107
具有任意自由度的B样条非均匀细分
Non-uniform subdivision for B-splines of arbitrary degree
摘要
Abstract
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环/节点插入Key words
arbitrary degree/ B-splines/ non-uniform subdivision/ d rounds/ knot insertion分类
信息技术与安全科学引用本文复制引用
孙立镌,刘扬,赵强..具有任意自由度的B样条非均匀细分[J].计算机应用研究,2011,28(5):1972-1974,3.基金项目
国家自然科学基金资助项目(60173055) （60173055）
