Common · Knowledge
De Casteljau's algorithm
Recursive method to evaluate polynomials in Bernstein form, used to work with Bézier curves
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.
From Wikipedia
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. The algorithm is numerically stable when compared to direct evaluation of polynomials. The computational complexity of this algorithm is O ( d n 2 ) {\displaystyle O(dn^{2})} , where d is the number of dimensions, and n is the number of control points. There exist faster alternatives.
Text: Wikipédia, CC BY-SA 4.0. ·
Related cards
-
P★
Paul de Casteljau
French mathematician and engineer (1930–2022)
-
R★★★
Ramer–Douglas–Peucker algorithm
Line simplification algorithm
-
B★
Bareiss algorithm
Algorithm for calculating determinants
-
T★★
Tridiagonal matrix algorithm
Variant of Gaussian elimination for solving tridiagonal systems of equations
-
★★★
Simplex algorithm
Algorithm
-
K★
Knuth's Algorithm X
Algorithm for exact cover problem