递推函数
P i r ( t ) = ( 1 − t ) P i r − 1 ( t ) + t P i + 1 r − 1 ( t ) , \begin{equation} \bm{P}_{i}^r (t) = (1-t) \bm{P}_{i}^{r-1} (t) + t \bm{P}_{i+1}^{r-1} (t), \end{equation} Pir(t)=(1−t)Pir−1(t)+tPi+1r−1(t),
其中,r = 1,2, ⋯ \cdots ⋯, n ; i=0,1, ⋯ \cdots ⋯, n-r; t ∈ [ 0 , 1 ] t\in[0, 1] t∈[0,1]
double step = 0.1;
for (double t = 0.0; t <= 1.0; t += step)
{for (int k = 0; k <= n; k++) {p[k][0].x = P[k].x; // 将控制点一维数组赋值给二维递归数组p[k][0].y = P[k].y; // 将控制点一维数组赋值给二维递归数组}for (int r = 1; r <= n; r++) {for (int i = 0; i <= n - r; i++) {p[i][r] = (1 - t) * p[i][r - 1] + t * p[i + 1][r - 1];}}// 绘制线//pDC->LineTo(ROUND(p[0][n].x), ROUND(p[0][n].y)); // MFC
}
参考 《计算几何算法与实现》孔令德