图学学报
• 图形学与可视化 • 上一篇 下一篇
出版日期:
发布日期:
Online:
Published:
摘要: 类似于经典的、应用于任意次均匀B 样条的Lane-Riesenfeld 细分算法, 提出了一种任意次非均匀B 样条的细分算法,算法包含加细和光滑两个步骤,可生成任意 次非均匀B 样条曲线。算法是基于于开花方法提出的,不同于以均匀B 样条基函数的卷积 公式为基础的Lane-Riesenfeld 细分算法。通过引入两个开花多项式,给出了算法正确性的 详细证明。算法的时间复杂度优于经典的任意次均匀B 样条细分算法,与已有的任意次非 均匀B 样条细分算法的计算量相当。
关键词: 计算机辅助几何设计, 细分, 开花, B 样条, 非均匀, 节点插入
Abstract: A subdivision algorithm is presented for 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 contains two steps: refining and smoothing, and achieves non-uniform B-Splines curve of arbitrary degree. The algorithm is based on blossoming rather than the continuous convolution formula for the uniform B-spline basis functions. Two blossoming polynomials are introduced to verify the correctness of the subdivision algorithm. The subdivision algorithm is more efficient than the classical uniform subdivision algorithm for B-splines of arbitrary degree, and as efficient as those currently available non-uniform subdivision algorithms for B-splines of arbitrary degree.
Key words: computer aided geometric design, subdivision, blossoming, B-splines; non-uniform, knot insertion
韩力文, 杨玉婷, 邱志宇. 一种任意次非均匀B 样条的细分算法[J]. 图学学报.
Han Liwen, Yang Yuting, Qiu Zhiyu. A Subdivision Algorithm for Non-uniform B-Splines of Arbitrary Degree[J]. Journal of Graphics.
0 / / 推荐
导出引用管理器 EndNote|Ris|BibTeX
链接本文: http://www.txxb.com.cn/CN/
http://www.txxb.com.cn/CN/Y2013/V34/I5/56