Efficient evaluation of multivariate polynomials

DOI10.1016/0167-8396(86)90018-XzbMath0606.65007OpenAlexW2074832341MaRDI QIDQ1084832

Wolfgang Volk, Larry L. Schumaker

Publication date: 1986

Published in: Computer Aided Geometric Design (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0167-8396(86)90018-x

zbMATH Keywords

data fittingsurfacespolynomial evaluationde Casteljau algorithmBernstein-Bézier methods

Mathematics Subject Classification ID

Numerical smoothing, curve fitting (65D10) Computation of special functions and constants, construction of tables (65D20) Multidimensional problems (41A63) Approximation by polynomials (41A10)

Related Items

Running error analysis of evaluation algorithms for bivariate polynomials in barycentric Bernstein form ⋮ The polynomial approximation in the finite element method ⋮ Convexity of parametric Bézier surfaces in terms of Gaussian curvature signatures ⋮ Algorithms for polynomials in Bernstein form ⋮ A shape preserving representation with an evaluation algorithm of linear complexity ⋮ The mixed directional difference-summation algorithm for generating the Bézier net of a trivariate four-direction box-spline ⋮ Evaluation algorithms for multivariate polynomials in Bernstein-Bézier form ⋮ Multiplication-free evaluation of polynomials via a stochastic Bernstein representation ⋮ On the accuracy of de Casteljau-type algorithms and Bernstein representations ⋮ Efficient computation of Bézier curves from their Bernstein-Fourier representation ⋮ Unnamed Item ⋮ The multivariate Horner scheme revisited ⋮ On the evaluation of rational triangular Bézier surfaces and the optimal stability of the basis ⋮ Accurate evaluation algorithm for bivariate polynomial in Bernstein-Bézier form ⋮ On multivariate polynomials in Bernstein-Bézier form and tensor algebra ⋮ Accurate evaluation of Bézier curves and surfaces and the Bernstein-Fourier algorithm ⋮ Algorithms for generating B-nets and graphically displaying spline surfaces on three- and four-directional meshes ⋮ Accurate Computations and Applications of Some Classes of Matrices ⋮ Change of basis algorithms for surfaces in CAGD ⋮ Point and tangent computation of tensor product rational Bézier surfaces ⋮ A unified approach to evaluation algorithms for multivariate polynomials ⋮ On the generalized Ball bases ⋮ Computing normal vector Bézier patches ⋮ On evaluating multivariate polynomials over finite fields ⋮ Algorithm 960

Cites Work

• A survey of curve and surface methods in CAGD
• Unnamed Item