Linear-time geometric algorithm for evaluating Bézier curves
New algorithm for evaluating a point on a Bézier curve and on a rational Bézier curve is given. The method has a geometric interpretation and a convex hull property. The computational complexity of the new algorithm is linear with respect to the degree of the considered curve, and its memory complexity is O(1).
READ FULL TEXT