Simple algorithms for computing the Bézier coefficients of the constrained dual Bernstein polynomials

作者:

Highlights:

摘要

Simple recurrence relations for the Bézier coefficients of the dual Bernstein polynomials are given. Using the recurrence relations, we propose fast methods for computing these coefficients. The complexity of the proposed algorithms is O(n), where n is the degree of the considered dual Bernstein polynomial basis.

论文关键词:Dual Bernstein basis,Constrained dual Bernstein basis,Bernstein–Bézier polynomial form,Bézier coefficients,Recurrence relations,Zeilberger’s algorithm

论文评审过程:Available online 29 September 2012.

论文官网地址:https://doi.org/10.1016/j.amc.2012.08.087