Add to ORKGwww.elsevier.com/locate/cagd Constrained polynomial degree reduction in the L2-norm equal
This paper presents an algorithm for optimal multi-degree reduction of ra-tional disk Bézier curve ...
This work considers non-convex mixed integer nonlinear programming where nonlinearity comes from the...
This work considers non-convex mixed integer nonlinear programming where nonlinearity comes from the...
AbstractIn the paper [H.S. Kim, Y.J. Ahn, Constrained degree reduction of polynomials in Bernstein–B...
AbstractIn this paper we show that the orthogonal complement of a subspace in the polynomial space o...
AbstractGiven a polynomial p in d variables and of degree n we want to find the best L2-approximatio...
In this paper, we develop a direct formula for determining the coefficients in the canonical basis o...
Abstract. We present a relation between the orthogonality of the constrained Le-gendre polynomials o...
AbstractIn this paper, we develop an analytic solution for the best one-sided approximation of polyn...
AbstractGiven a polynomial p in d variables and of degree n we want to find the best L2-approximatio...
Optimal degree reductions, i.e. best approximations of n-th degree Bezier curves by Bezier curves of...
0.80SIGLELD:7074.135(E.E/CON--80.5). / BLDSC - British Library Document Supply CentreGBUnited Kingdo
10.1023/B:JOTA.0000005450.58251.6dJournal of Optimization Theory and Applications1192357-37
AbstractIn this paper we give a new characterization of the classical orthogonal polynomials (Hermit...
For P 2 Z[x], let kPk denote the Euclidean norm of the coefficient vector of P. For an algebraic num...
This paper presents an algorithm for optimal multi-degree reduction of ra-tional disk Bézier curve ...
This work considers non-convex mixed integer nonlinear programming where nonlinearity comes from the...
This work considers non-convex mixed integer nonlinear programming where nonlinearity comes from the...
AbstractIn the paper [H.S. Kim, Y.J. Ahn, Constrained degree reduction of polynomials in Bernstein–B...
AbstractIn this paper we show that the orthogonal complement of a subspace in the polynomial space o...
AbstractGiven a polynomial p in d variables and of degree n we want to find the best L2-approximatio...
In this paper, we develop a direct formula for determining the coefficients in the canonical basis o...
Abstract. We present a relation between the orthogonality of the constrained Le-gendre polynomials o...
AbstractIn this paper, we develop an analytic solution for the best one-sided approximation of polyn...
AbstractGiven a polynomial p in d variables and of degree n we want to find the best L2-approximatio...
Optimal degree reductions, i.e. best approximations of n-th degree Bezier curves by Bezier curves of...
0.80SIGLELD:7074.135(E.E/CON--80.5). / BLDSC - British Library Document Supply CentreGBUnited Kingdo
10.1023/B:JOTA.0000005450.58251.6dJournal of Optimization Theory and Applications1192357-37
AbstractIn this paper we give a new characterization of the classical orthogonal polynomials (Hermit...
For P 2 Z[x], let kPk denote the Euclidean norm of the coefficient vector of P. For an algebraic num...
This paper presents an algorithm for optimal multi-degree reduction of ra-tional disk Bézier curve ...
This work considers non-convex mixed integer nonlinear programming where nonlinearity comes from the...
This work considers non-convex mixed integer nonlinear programming where nonlinearity comes from the...