Fast algorithm for generating Bernstein-Bézier polynomials (Q1339364)
From MaRDI portal
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Fast algorithm for generating Bernstein-Bézier polynomials |
scientific article |
Statements
Fast algorithm for generating Bernstein-Bézier polynomials (English)
0 references
2 April 1995
0 references
The author proposes and discusses a new Monte Carlo type algorithm for generating Bézier-Bernstein (BB) polynomials based on a probabilistic interpretation of them. The computational advantages of the new algorithm are: The execution time \(T_ A\) is independent of \(n\) (the degree of the BB); \(T_ A\) depends linearly on the number of random variables generated to evaluate BB (typically between 12-30); minimal intermediate storage requirements; there is no need to store pretabulated values of polynomials; there are no problems of numerical stability. The algorithm is recommended for solving curve fitting and image processing problems in which processing of a large number of data is necessary.
0 references
Monte Carlo method
0 references
Bézier-Bernstein polynomials
0 references
numerical stability
0 references
curve fitting
0 references
image processing
0 references
