A general method is given for constructing sets of sufficient linear conditions that ensure convexity of a polynomial in Bernstein-Bezier form on a triangle. Using the linear conditions, computational methods based on macro-element spline spaces are developed to construct convexity preserving splines over triangulations that interpolate or approximate given scattered data
The use of polynomial splines as a basis for the interpolation of discrete data can be theoretically...
AbstractA construction of linear sufficient convexity conditions for polynomial tensor-product splin...
AbstractIn this paper, we give a geometrical characterization of the convexity of Bézier nets of som...
A general method is given for constructing sets of sufficient linear conditions that ensure convexit...
AbstractWe use bivariate C1 cubic splines to deal with convexity preserving scattered data interpola...
Linear conditions for a C0 spline to be convex are developed and used to create some convexity prese...
This study deals with constructing a convexity-preserving bivariate C1 interpolants to scattered dat...
This report deals with approximation of a given scattered univariate or bivariate data set that poss...
AbstractA review of shape preserving approximation methods and algorithms for approximating univaria...
A C1 convex surface data interpolation scheme is presented to preserve the shape of scattered data a...
We present a concise characterization of the Bernstein-Bezier (BE) form of an implicitly defined biv...
The aim of this survey is to give an overview of the field of splines over triangulations. We summar...
SIGLEAvailable from British Library Document Supply Centre- DSC:1571.43(DU-DMCS-AA--899) / BLDSC - B...
AbstractA necessary and sufficient condition for the convexity of the Bernstein polynomial over the ...
Bivariate quadratic simplical B-splines defined by their corresponding set of knots derived from a (...
The use of polynomial splines as a basis for the interpolation of discrete data can be theoretically...
AbstractA construction of linear sufficient convexity conditions for polynomial tensor-product splin...
AbstractIn this paper, we give a geometrical characterization of the convexity of Bézier nets of som...
A general method is given for constructing sets of sufficient linear conditions that ensure convexit...
AbstractWe use bivariate C1 cubic splines to deal with convexity preserving scattered data interpola...
Linear conditions for a C0 spline to be convex are developed and used to create some convexity prese...
This study deals with constructing a convexity-preserving bivariate C1 interpolants to scattered dat...
This report deals with approximation of a given scattered univariate or bivariate data set that poss...
AbstractA review of shape preserving approximation methods and algorithms for approximating univaria...
A C1 convex surface data interpolation scheme is presented to preserve the shape of scattered data a...
We present a concise characterization of the Bernstein-Bezier (BE) form of an implicitly defined biv...
The aim of this survey is to give an overview of the field of splines over triangulations. We summar...
SIGLEAvailable from British Library Document Supply Centre- DSC:1571.43(DU-DMCS-AA--899) / BLDSC - B...
AbstractA necessary and sufficient condition for the convexity of the Bernstein polynomial over the ...
Bivariate quadratic simplical B-splines defined by their corresponding set of knots derived from a (...
The use of polynomial splines as a basis for the interpolation of discrete data can be theoretically...
AbstractA construction of linear sufficient convexity conditions for polynomial tensor-product splin...
AbstractIn this paper, we give a geometrical characterization of the convexity of Bézier nets of som...
DOI
Add to ORKG