Convexity-preserving interpolatory subdivision
The authors present a subdivision algorithm for shape preserving function interpolation in \(\mathbb{R}\) and \(\mathbb{R}^ 2\). This algorithm is a useful and flexible tool for curve and surface generation in computer aided geometric design (CAGD). Complete demonstrations of each case are made. The method is based on iterative knot insertion and guarantees preservation of convexity. The paper is richly illustrated. A simplified algorithm useful on the construction of surfaces is also presented. To illustrate the behaviour of the method to fit data with shape preservation the authors present two numerical examples with corresponding figures.
- A 4-point interpolatory subdivision scheme for curve design
- Algorithms for computing shape-preserving spline approximations to data
- Co-Monotone Interpolating Splines of Arbitrary Degree—a Local Approach
- Constrained \(L_ p\) approximation
- Constrained Interpolation
- Constrained interpolation and smoothing
- scientific article; zbMATH DE number 3957867 (Why is no real title available?)
- scientific article; zbMATH DE number 4071586 (Why is no real title available?)
- scientific article; zbMATH DE number 3640777 (Why is no real title available?)
- scientific article; zbMATH DE number 3998405 (Why is no real title available?)
- Interpolation by smooth functions under restrictions on the derivatives
- Monotone interpolation of scattered data in \({\mathbb{R}}^ s\)
- Monotone Piecewise Bicubic Interpolation
- Monotone Piecewise Cubic Interpolation
- Monotonicity Preserving Surface Interpolation
- On Monotone and Convex Spline Interpolation
- On Shape Preserving Quadratic Spline Interpolation
- Shape-Preserving Bivariate Interpolation
- Smoothing and Interpolation in a Convex Subset of a Hilbert Space
- Taylorian fields and subdivision algorithms
- Interpolatory convexity-preserving subdivision schemes for curves and surfaces
- A note on convexity-preserving interpolation subdivision
- Convexity preserving interpolatory subdivision schemes
- A geometric look at corner cutting
- Shape preserving interpolatory subdivision schemes for nonuniform data
- Convexity preservation of six point \(C^{2}\) interpolating subdivision scheme
- Shape-preserving interpolation by splines using vector subdivision
- A new class of \(2m\)-point binary non-stationary subdivision schemes
- The four-point interpolation subdivision curve is neither convex nor concave in all but one case
- Convexity preserving interpolatory subdivision with conic precision
- Ternary univariate curvature-preserving subdivision
- A new four-point shape-preserving \(C^3\) subdivision scheme
- Normal based subdivision scheme for curve design
- scientific article; zbMATH DE number 1286307 (Why is no real title available?)
- scientific article; zbMATH DE number 1008319 (Why is no real title available?)
- scientific article; zbMATH DE number 1008475 (Why is no real title available?)
- scientific article; zbMATH DE number 2073958 (Why is no real title available?)
- On convex quadratic approximation
- Conditions on shape preserving of stationary polynomial reproducing subdivision schemes
- scientific article; zbMATH DE number 822389 (Why is no real title available?)
- scientific article; zbMATH DE number 1404605 (Why is no real title available?)
- A class of shape preserving 5-point n-ary approximating schemes
- Incenter subdivision scheme for curve interpolation
- Sectional-curvature preserving skinning surfaces
- A variational approach to subdivision
- Shape-preserving subdivision scheme with the third-order accuracy and C^2 smoothness
- Shape preserving \(HC^2\) interpolatory subdivision
- Convexity-preserving interpolation of trigonometric polynomial curves with a shape parameter
This page was built for publication: Convexity-preserving interpolatory subdivision
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1315804)