Abstract
We present an efficient method to solve the problem of the constrained least squares approximation of the rational Bézier curve by the polynomial Bézier curve. The presented algorithm uses the dual constrained Bernstein basis polynomials, and exploits their recursive properties. Examples are given, showing the effectiveness of the algorithm.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Ahn, Y.J.: Using Jacobi polynomials for degree reduction of Bézier curves with C k-constraints. Comput. Aided Geom. Des. 20, 423–434 (2003)
Cai, H.J., Wang, G.J.: Constrained approximation of rational Bézier curves based on a matrix expression of its end points continuity condition. Comput. Aided Des. 42, 495–504 (2010)
Dahlquist, G., Björck, A.: Numerical Methods in Scientific Computing, vol. I. SIAM, Philadelphia (2008)
Farin, G.E.: Curves and Surfaces for Computer-Aided Geometric Design. A Practical Guide. Academic Press, Boston (1996)
Floater, M.S.: High order approximation of rational curves by polynomial curves. Comput. Aided Des. 23, 621–628 (2006)
Gentleman, W.M.: Implementing Clenshaw–Curtis quadrature—I and II. Commun. ACM 15, 337–346 (1972)
Huang, Y., Su, H., Lin, H.: A simple method for approximating rational Bézier curve using Bézier curves. Comput. Aided Geom. Des. 25, 697–699 (2008)
Keller, P.: A method for indefinite integration of oscillatory and singular functions. Numer. Algorithms 46, 219–251 (2007)
Koekoek, R., Lesky, P., Swarttouw, R.F.: Hypergeometric Orthogonal Polynomials and Their q-Analogues. Springer, Berlin (2010)
Lee, B.-G., Park, Y.: Approximate conversion of rational Bézier curves. J. KSIAM 2, 88–93 (1998)
Lewanowicz, S.: Quick construction of recurrence relations for the Jacobi coefficients. J. Comput. Appl. Math. 43, 355–372 (1992)
Lewanowicz, S., Woźny, P.: Multi-degree reduction of tensor product Bézier surfaces with general constraints. Appl. Math. Comput. 217, 4596–4611 (2011)
Lewanowicz, S., Woźny, P.: Bézier representation of the constrained dual Bernstein polynomials. arXiv:1109.1169v1[math.NA](2011)
Liu, L.G., Wang, G.J.: Recursive formulae for Hermite polynomial approximation to rational Bézier curves. In: Martin, R., Wang, W.P. (eds.) Proc. Geom. Modeling and Processing 2000: Theory and Applications, pp. 190–197. IEEE Computer Society, Los Alamitos (2000)
Lu, L.: Weighted progressive iteration approximation of rational curves. Comput. Aided Geom. Des. 27, 127–137 (2010)
Lu, L.: Sample-based polynomial approximation of rational Bézier curves. J. Comput. Appl. Math. 235, 1557–1563 (2011)
Sederberg, T.W., Kakimoto, M.: Approximating rational curves using polynomial curves. In: Farin, G. (ed.) NURBS for Curve and Surface Design, pp. 144–158. SIAM, Philadelphia (1991)
Trefethen, L.N.: Is Gauss quadrature better than Clenshaw-Curtis? SIAM Rev. 50, 67–87 (2008)
Wang, G.J., Sederberg, T.W., Chen, F.L.: On the convergence of polynomial approximation of rational functions. J. Approx. Theory 89, 267–288 (1997)
Woźny, P., Lewanowicz, S.: Multi-degree reduction of Bézier curves with constraints, using dual Bernstein basis polynomials. Comput. Aided Geom. Des. 26, 566–579 (2009)
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
About this article
Cite this article
Lewanowicz, S., Woźny, P. & Keller, P. Polynomial approximation of rational Bézier curves with constraints. Numer Algor 59, 607–622 (2012). https://doi.org/10.1007/s11075-011-9507-0
Received:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s11075-011-9507-0