de Casteljau's algorithm

Summary

De Casteljau's algorithm computes a point of a Bézier curve by repeated linear interpolation between control points. It also evaluates polynomials in Bernstein–Bézier form. It uses only convex combinations, so it is numerically stable. The intermediate points also give the control points of the two halves of the curve, which is the basis of subdivision methods in computer-aided design.