We prove the convexity of large classes of functional splines with help of results on quasiconcave and pseudoconcave functions. The method developed for functional splines can also be used for smooth approximations of convex polyhedrons and some other convex surfaces.
Recommendations
Cites work
- \(G^{n-1}\)-functional splines for interpolation and approximation of curves, surfaces and solids
- Another Proof that Convex Functions are Locally Lipschitz
- Blending of implicit surfaces with functional splines
- Criteria for quasi-convexity and pseudo-convexity: Relationships and comparisons
- Generalized concavity
- scientific article; zbMATH DE number 3858866 (Why is no real title available?)
Cited in
(16)- A characterization of a class of polynomial splines by convolution
- On convexity of piecewise polynomial functions on triangulations
- Interpolation and approximation from convex sets
- On convexity of planar curves and its application in CAGD
- On functionals dual to minimal splines
- scientific article; zbMATH DE number 6492423 (Why is no real title available?)
- scientific article; zbMATH DE number 991596 (Why is no real title available?)
- scientific article; zbMATH DE number 3861718 (Why is no real title available?)
- The generalized convexity cone of splines with multiple knots
- scientific article; zbMATH DE number 3912934 (Why is no real title available?)
- Convexity preserving \(C^0\) splines
- On spline approximation for bivariate functions of increasing convex type
- Geometric interpolants with different degrees of smoothness
- Cubic algebraic spline curves design
- Sectional-curvature preserving skinning surfaces
- Blending an implicit with a parametric surface
This page was built for publication: On the convexity of functional splines
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1803687)
