Article ID | Journal | Published Year | Pages | File Type |
---|---|---|---|---|
4628654 | Applied Mathematics and Computation | 2013 | 5 Pages |
Abstract
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)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 Bézier curves.
Related Topics
Physical Sciences and Engineering
Mathematics
Applied Mathematics
Authors
Paweł Woźny,