bezier static method
Implementation
static num bezier (List v, num k) {
double b = 0;
int n = v.length - 1;
var pw = math.pow;
var bn = Utils.bernstein;
for (int i = 0; i <= n; i++) {
b += pw(1 - k, n - i) * pw(k, i) * v[i] * bn(n, i);
}
return b;
}