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

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.