科研之友
微信
新浪微博
Facebook
分享链接
摘要
Fast and efficient methods of evaluation of the connection coefficients between shifted Jacobi and Bernstein polynomials are proposed. The complexity of the algorithms is O(n), where n denotes the degree of the Bernstein basis. Given results can be helpful in a computer aided geometric design, e. g., in the optimization of some methods of the degree reduction of Bezier curves.
- 出版日期2013-10-1
