Pages that link to "Item:Q1084832"
From MaRDI portal
The following pages link to Efficient evaluation of multivariate polynomials (Q1084832):
Displayed 14 items.
- Change of basis algorithms for surfaces in CAGD (Q672159) (← links)
- Point and tangent computation of tensor product rational Bézier surfaces (Q674223) (← links)
- Running error analysis of evaluation algorithms for bivariate polynomials in barycentric Bernstein form (Q818856) (← links)
- The mixed directional difference-summation algorithm for generating the Bézier net of a trivariate four-direction box-spline (Q857858) (← links)
- Evaluation algorithms for multivariate polynomials in Bernstein-Bézier form (Q860688) (← links)
- Algorithms for polynomials in Bernstein form (Q1105314) (← links)
- Algorithms for generating B-nets and graphically displaying spline surfaces on three- and four-directional meshes (Q1183540) (← links)
- The polynomial approximation in the finite element method (Q1893572) (← links)
- Convexity of parametric Bézier surfaces in terms of Gaussian curvature signatures (Q1895922) (← links)
- Multiplication-free evaluation of polynomials via a stochastic Bernstein representation (Q1923373) (← links)
- A shape preserving representation with an evaluation algorithm of linear complexity (Q2388490) (← links)
- On the generalized Ball bases (Q2491236) (← links)
- A unified approach to evaluation algorithms for multivariate polynomials (Q4372657) (← links)
- Computing normal vector Bézier patches (Q5958698) (← links)