Using Laurent polynomial representation for the analysis of non-uniform binary subdivision schemes
From MaRDI portal
Publication:1805836
DOI10.1023/A:1018907522165zbMath0936.65013MaRDI QIDQ1805836
Publication date: 31 October 1999
Published in: Advances in Computational Mathematics (Search for Journal in Brave)
smoothness analysisinterpolatory 4-point schemeLaurent polynomial representationnon-uniform binary linear subdivision schemes
Numerical interpolation (65D05) Algorithms for approximation of functions (65D15) Computer-aided design (modeling of curves and surfaces) (65D17)
Related Items (21)
Subdivision models for varying-resolution and generalized perturbations ⋮ A unified three point approximating subdivision scheme ⋮ Convergence of univariate non-stationary subdivision schemes via asymptotic similarity ⋮ Non-stationary versions of fixed-point theory, with applications to fractals and subdivision ⋮ Ternary six-point interpolating subdivision scheme ⋮ Totally positive functions through nonstationary subdivision schemes ⋮ Scalar and Hermite subdivision schemes ⋮ A divided differences based medium to analyze smoothness of the binary bivariate refinement schemes ⋮ Convergence of multivariate non-stationary vector subdivision schemes ⋮ A ‘subdivision regression’ model for data analysis ⋮ Unnamed Item ⋮ Stationary and nonstationary affine combination of subdivision masks ⋮ Analysis of quasi-uniform subdivision. ⋮ Analysis of a class of nonlinear subdivision schemes and associated multiresolution transforms ⋮ Geometric conditions for tangent continuity of interpolatory planar subdivision curves ⋮ A new method for the analysis of univariate nonuniform subdivision schemes ⋮ Limits of level and parameter dependent subdivision schemes: a matrix approach ⋮ High order smoothness of non-linear Lane-Riesenfeld algorithms in the functional setting ⋮ Hermite subdivision schemes and Taylor polynomials ⋮ Attractors of trees of maps and of sequences of maps between spaces with applications to subdivision ⋮ \(C^2\) subdivision over triangulations with one extraordinary point
This page was built for publication: Using Laurent polynomial representation for the analysis of non-uniform binary subdivision schemes
