DOIAbstract
AbstractLetΣbe the set of vertices of a convex non-degenerate polyhedron inRn,n⩾2. We suggest an algorithm to construct smooth convex algebraic hypersurfaces of degree as small as possible, going throughΣ
AbstractLetΣbe the set of vertices of a convex non-degenerate polyhedron inRn,n⩾2. We suggest an algorithm to construct smooth convex algebraic hypersurfaces of degree as small as possible, going throughΣ
AbstractWe present a method to construct convex cubic C1-splines which interpolate a given convex da...
This paper is concerned with applications of the theory of approximation and interpolation based on ...
Department Head: Gerhard Dangelmayr.2010 Spring.Includes bibliographical references (pages 67-68).Th...
AbstractLetΣbe the set of vertices of a convex non-degenerate polyhedron inRn,n⩾2. We suggest an alg...
AbstractWe have implemented a Matlab code to compute Discrete Extremal Sets (of Fekete and Leja type...
In this paper we use some well known theorems of algebraic geometry in reducing polynomial Hermite i...
AbstractThree questions concerning the interpolation of a set (xi, yi, zi), i = 1,…, N, in R3 by a c...
Summary. This article describes a method to compute successive convex approxi-mations of the convex ...
We consider the problem of interpolating scattered data in ℝ3 by analmost geometrically smoothGC2 su...
Shape preserving approximations are constructed by interpolating the data with polynomial splines of...
AbstractWe prove the following criterion: a compact connected piecewise-linear hypersurface (without...
International audienceIn this paper, interpolating curve or surface with linear inequality constrain...
In computational fluid dynamics and in CAD/CAM a physical boundary, usually known only discreetly (s...
Abstract. Hyperbolic polynomials are real polynomials whose real hypersurfaces are max-imally nested...
AbstractThis paper is concerned with the convex interpolation of data sets. Based on the staircase a...
AbstractWe present a method to construct convex cubic C1-splines which interpolate a given convex da...
This paper is concerned with applications of the theory of approximation and interpolation based on ...
Department Head: Gerhard Dangelmayr.2010 Spring.Includes bibliographical references (pages 67-68).Th...
AbstractLetΣbe the set of vertices of a convex non-degenerate polyhedron inRn,n⩾2. We suggest an alg...
AbstractWe have implemented a Matlab code to compute Discrete Extremal Sets (of Fekete and Leja type...
In this paper we use some well known theorems of algebraic geometry in reducing polynomial Hermite i...
AbstractThree questions concerning the interpolation of a set (xi, yi, zi), i = 1,…, N, in R3 by a c...
Summary. This article describes a method to compute successive convex approxi-mations of the convex ...
We consider the problem of interpolating scattered data in ℝ3 by analmost geometrically smoothGC2 su...
Shape preserving approximations are constructed by interpolating the data with polynomial splines of...
AbstractWe prove the following criterion: a compact connected piecewise-linear hypersurface (without...
International audienceIn this paper, interpolating curve or surface with linear inequality constrain...
In computational fluid dynamics and in CAD/CAM a physical boundary, usually known only discreetly (s...
Abstract. Hyperbolic polynomials are real polynomials whose real hypersurfaces are max-imally nested...
AbstractThis paper is concerned with the convex interpolation of data sets. Based on the staircase a...
AbstractWe present a method to construct convex cubic C1-splines which interpolate a given convex da...
This paper is concerned with applications of the theory of approximation and interpolation based on ...
Department Head: Gerhard Dangelmayr.2010 Spring.Includes bibliographical references (pages 67-68).Th...
Add to ORKG