De Casteljau's Algorithm

A De Casteljau's Algorithm is a Polynomial Evaluation Algorithm that is a recursive algorithm for evaluating polynomials in Bernstein form or Bezier curve.

• Context:
  • It can also be a Spline Interpolation Algorithm.
  • It can be implemented by a De Casteljau's System.
  • …
• Example(s):
  • …
• Counter-Example(s):
  • Clenshaw Algorithm,
  • De Boor's Algorithm,
  • Estrin's Scheme Algorithm,
  • Horner's Scheme Algorithm,
  • Lill's Method Algorithm,
  • Ruffini's Rule Algorithm.
• See: Recurrence Relation, Numerical Analysis, Recursion, Polynomial Root-Finding Algorithm, Newton's Method, Mathematics, Computer Science, William George Horner, Joseph-Louis Lagrange, Polynomial, Numerically Stable, Paul de Casteljau.

---

---

References

2021

• (Wikipedia, 2021) ⇒ https://en.wikipedia.org/wiki/De_Casteljau's_algorithm Retrieved:2021-9-5.
  • In the mathematical field of numerical analysis, De Casteljau's algorithm is a recursive method to evaluate polynomials in Bernstein form or Bézier curves, named after its inventor Paul de Casteljau. De Casteljau's algorithm can also be used to split a single Bézier curve into two Bézier curves at an arbitrary parameter value.

    Although the algorithm is slower for most architectures when compared with the direct approach, it is more numerically stable.

---