Convergence analysis of corner cutting algorithms refining nets of functions
From MaRDI portal
Publication:1998050
Recommendations
Cites work
- scientific article; zbMATH DE number 124385 (Why is no real title available?)
- scientific article; zbMATH DE number 1133035 (Why is no real title available?)
- scientific article; zbMATH DE number 3306054 (Why is no real title available?)
- A family of non-uniform subdivision schemes with variable parameters for curve design
- A geometric look at corner cutting
- A new method for the analysis of univariate nonuniform subdivision schemes
- Analysis of subdivision schemes for nets of functions by proximity and controllability
- Blending based corner cutting subdivision scheme for nets of curves
- Cutting corners always works
- Dual univariate \(m\)-ary subdivision schemes of de Rham-type
- Interpolatory blending net subdivision schemes of Dubuc-Deslauriers type
- Local corner cutting and the smoothness of the limiting curve
- Nonuniform corner cutting
- On the regularity of de Rham curves
- Regularity of non-stationary subdivision: a matrix approach
- Sur les courbes limités de polygones obtenus par trisection
- Sur une courbe plane
- Transfinite mappings and their application to grid generation
Cited in
(6)- A non-uniform corner-cutting subdivision scheme with an improved accuracy
- Applied scientific computing. XV: Innovative modeling and simulation in sciences
- Corner cutting evaluation algorithms for general rational curves
- Cutting corners always works
- Error analysis of corner cutting algorithms
- A shape preserving corner cutting algorithm with an enhanced accuracy
This page was built for publication: Convergence analysis of corner cutting algorithms refining nets of functions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1998050)