Convexity-preserving interpolatory subdivision
DOI10.1016/0167-8396(94)90023-XzbMath0790.65005OpenAlexW2026088070MaRDI QIDQ1315804
Alain Le Méhauté, Florencio I. Utreras
Publication date: 23 June 1994
Published in: Computer Aided Geometric Design (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0167-8396(94)90023-x
numerical examplesshape preservationcomputer aided geometric designsubdivision algorithmpreservation of convexitycurve and surface generationiterative knot insertionshape preserving function interpolation
Numerical interpolation (65D05) Approximation with constraints (41A29) Computer-aided design (modeling of curves and surfaces) (65D17)
Related Items (15)
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Monotone interpolation of scattered data in \({\mathbb{R}}^ s\)
- Algorithms for computing shape-preserving spline approximations to data
- Constrained \(L_ p\) approximation
- Constrained interpolation and smoothing
- A 4-point interpolatory subdivision scheme for curve design
- Interpolation by smooth functions under restrictions on the derivatives
- Taylorian fields and subdivision algorithms
- Shape-Preserving Bivariate Interpolation
- On Shape Preserving Quadratic Spline Interpolation
- Monotone Piecewise Bicubic Interpolation
- Monotonicity Preserving Surface Interpolation
- Co-Monotone Interpolating Splines of Arbitrary Degree—a Local Approach
- Smoothing and Interpolation in a Convex Subset of a Hilbert Space
- Monotone Piecewise Cubic Interpolation
- Constrained Interpolation
- On Monotone and Convex Spline Interpolation
This page was built for publication: Convexity-preserving interpolatory subdivision