Univariate approximating schemes and their non-tensor product generalization
From MaRDI portal
Publication:1738279
DOI10.1515/math-2018-0126zbMath1452.65038OpenAlexW2914441772WikidataQ128496131 ScholiaQ128496131MaRDI QIDQ1738279
Publication date: 29 March 2019
Published in: Open Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1515/math-2018-0126
Numerical computation using splines (65D07) Numerical interpolation (65D05) Computer-aided design (modeling of curves and surfaces) (65D17)
Cites Work
- Designing multi-parameter curve subdivision schemes with high continuity
- Binary univariate dual and primal subdivision schemes
- Convergence, error estimation and some properties of four-point interpolation subdivision scheme
- A family of subdivision schemes with cubic precision
- The \(m\)-point approximating subdivision scheme
- A 4-point interpolatory subdivision scheme for curve design
- Monotonicity preserving interpolatory subdivision schemes
- A Chaikin-based variant of Lane-Riesenfeld algorithm and its non-tensor product extension
- Generalized Lane-Riesenfeld algorithms
- Dual univariate \(m\)-ary subdivision schemes of de Rham-type
- A six-point variant on the Lane-Riesenfeld algorithm
- Monotonicity preserving subdivision schemes
- Visualization of data preserving monotonicity
- A new four-point shape-preserving \(C^3\) subdivision scheme
- Subdivision schemes in geometric modelling
- A Theoretical Development for the Computer Generation and Display of Piecewise Polynomial Surfaces
- Simple Regularity Criteria for Subdivision Schemes
This page was built for publication: Univariate approximating schemes and their non-tensor product generalization