Progressive iterative approximation and bases with the fastest convergence rates
From MaRDI portal
Publication:733388
DOI10.1016/j.cagd.2006.10.001zbMath1171.65319OpenAlexW2019696304MaRDI QIDQ733388
Juan Manuel Peña, Jorge Delgado
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
Related Items
Richardson's iterative method for surface interpolation, Tests for the recognition of total positivity, Progressive iterative approximation for regularized least square bivariate B-spline surface fitting, Richardson method and totally nonnegative linear systems, Generalized B-splines' geometric iterative fitting method with mutually different weights, 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, Generalized and optimal sequence of weights on a progressive‐iterative approximation method with memory for least square fitting, On the progressive iteration approximation property and alternative iterations, An iterative algorithm for polynomial approximation of rational triangular Bézier surfaces, Accurate Computations and Applications of Some Classes of Matrices, Iterative rational least squares fitting, Iterative process for \(G^{2}\)-multi degree reduction of Bézier curves, Accurate bidiagonal decomposition of totally positive h-Bernstein-Vandermonde matrices and applications, A collection of examples where Neville elimination outperforms Gaussian elimination, A Comparison of Different Progressive Iteration Approximation Methods, Iterative refinement for Neville elimination, A composite iterative procedure with fast convergence rate for the progressive-iteration approximation of curves, Preconditioned progressive iterative approximation for triangular Bézier patches and its application, Degree reduction of \(S-\lambda\) curves using a genetic simulated annealing algorithm
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
