...
首页> 外文期刊>Computer Aided Geometric Design >Change of basis algorithms for surfaces in CAGD
【24h】

Change of basis algorithms for surfaces in CAGD

机译:CAGD中曲面的基础算法的更改

获取原文
获取原文并翻译 | 示例
           

摘要

The computational complexity of general change of basis algorithms from one bivariate: polynomial basis of degree n to another bivariate polynomial basis of degree n using matrix multiplication is O(n~4). Applying blossoming and duality, we derive change of basis algorithms with computational complexity O(n~3) between two important classes of polynomial bases used for representing surfaces in CAGD: B-bases and L-bases. Change of basis algorithms for B-bases follow from their blossoming property; change of basis algorithms for L-bases follow from the duality between L-bases and B-bases. The Bezier and multinomial bases are special cases of both B-bases and L-bases, so these algorithms can be used to convert between the B6zier and multinomial forms. We also show that the bivariate Horner evaluation algorithm for the multinomial basis is dual to the bivariate de Boor evaluation algorithm for B-patches.
机译:使用矩阵乘法,从一个双变量:n次多项式基础到n个其他双变量多项式基础的基本算法的一般更改的计算复杂度为O(n〜4)。应用开花和对偶,我们得出了用于在CAGD中表示曲面的两个重要的多项式基类之间的计算复杂度为O(n〜3)的基算法的变化:B基和L基。 B基的基础算法的变化取决于它们的开花特性。 L基的基础算法的变化源自L基和B基之间的对偶关系。 Bezier和多项式基是B基和L基的特例,因此这些算法可用于在B6zier和多项式之间进行转换。我们还表明,用于多项式的双变量Horner评估算法对B补丁的双变量de Boor评估算法是双重的。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号