A new algorithm for computing a point on a polynomial or rational curve in Bézier form is proposed. The method has a geometric interpretation and uses only convex combinations of control points. The new algorithm's computational complexity is linear with respect to the number of control points and its memory complexity is O(1). Some remarks on similar methods for surfaces in rectangular and triangular Bézier form are also given.

No abstract

New differential-recurrence properties of dual Bernstein polynomials are given which follow from relations between dual Bernstein and orthogonal Hahn and Jacobi polynomials. Using these results, a fourth-order differential equation satisfied by dual Bernstein polynomials has been constructed. Also, a fourth-order recurrence relation for these polynomials has been obtained; this result may be useful in the efficient solution of some computational problems.