David F. McAllister
ABSTRACT
Generalizations of H. L. Loeb's dynamic programming algorithm' for rational Chebychev approximation are discussed and conditions for monotone convergence of the sequence of deviations are derived. Implementation strategies to insure feasibility and possible modifications to produce super linear convergence are included.
- 1.H. L. Loeb, "Algorithms for Chebychev Approximation Using the Ratio of Linear Forms," SIAM Journal 8, 458 (1960)Google Scholar
Index Terms
- Contraction map methods for discrete rational Chebychev approximation
Recommendations
Conversion of Rational Bezier Curves into Non-rational Bezier Curves Using Progressive Iterative Approximation
CGIV '13: Proceedings of the 2013 10th International Conference Computer Graphics, Imaging and Visualization (cgiv 2013)This paper presents a method to convert rational Bézier curves into non-rational Bézier curve. Using the proposed method, a series of points are first sampled from the input rational Bézier curve. Then a Progressive Iterative Approximation algorithm is ...
Rational Quadratic Approximation to Real Plane Algebraic Curves
GMP '04: Proceedings of the Geometric Modeling and Processing 2004An algorithm is proposed to give a global approximationto an implicit real plane algebraic curve with rationalquadratic B-splines. The algorithm consists of three steps:curve segmentation, segment approximation and curve tracing.The curve is first ...
Rational approximation schemes for rotation-minimizing frames on Pythagorean-hodograph curves
An adapted frame (t, u, v) on a space curve r(ξ) is a right-handed set of three orthonormal vectors, where t is the unit tangent and u, v span the curve normal plane. For such frames to have a rational dependence on the curve parameter, r(ξ) must be a ...
Comments