Progressive iterative approximation and bases with the fastest convergence rates
From MaRDI portal
Publication:733388
DOI10.1016/j.cagd.2006.10.001zbMath1171.65319MaRDI QIDQ733388
Jorge Delgado, Juan Manuel Peña
Publication date: 16 October 2009
Published in: Computer Aided Geometric Design (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.cagd.2006.10.001
65D07: Numerical computation using splines
Related Items
A Comparison of Different Progressive Iteration Approximation Methods, On the progressive iteration approximation property and alternative iterations, Iterative process for \(G^{2}\)-multi degree reduction of Bézier curves, Richardson method and totally nonnegative linear systems, Sample-based polynomial approximation of rational Bézier curves, Weighted progressive iteration approximation and convergence analysis, Local progressive-iterative approximation format for blending curves and patches, A collection of examples where Neville elimination outperforms Gaussian elimination, Richardson's iterative method for surface interpolation, Tests for the recognition of total positivity, An iterative algorithm for polynomial approximation of rational triangular Bézier surfaces, Iterative refinement for Neville elimination
Uses Software
Cites Work
- Shape preserving properties of the generalised Ball basis
- Totally positive bases and progressive iteration approximation
- Totally positive bases for shape preserving curve design and optimality of \(B\)-splines
- Shape preserving representations and optimality of the Bernstein basis
- Efficient algorithms for Bézier curves
- On the generalized Ball bases
- Totally positive matrices
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item