Polynomial approximation of rational Bézier curves with constraints

Authors:
Stanisław Lewanowicz;Paweł Woźny;Paweł Keller
Affiliations:
Institute of Computer Science, University of Wrocław, Wrocław, Poland 50-383;Institute of Computer Science, University of Wrocław, Wrocław, Poland 50-383;Institute of Computer Science, University of Wrocław, Wrocław, Poland 50-383
Venue:
Numerical Algorithms
Year:
2012

Citing 13
Cited 3

Quick construction of recurrence relations for the Jacobi coefficients

Journal of Computational and Applied Mathematics
On the convergence of polynomial approximation of rational functions

Journal of Approximation Theory
Curves and Surfaces for Computer-Aided Geometric Design: A Practical Code

Curves and Surfaces for Computer-Aided Geometric Design: A Practical Code
Recursive Formulae for Hermite Polynomial Approximations to Rational Bézier Curves

GMP '00 Proceedings of the Geometric Modeling and Processing 2000
Using Jacobi polynomials for degree reduction of Bézier curves withCk-constraints

Computer Aided Geometric Design
Is Gauss Quadrature Better than Clenshaw-Curtis?

SIAM Review
Numerical Methods in Scientific Computing: Volume 1

Numerical Methods in Scientific Computing: Volume 1
A simple method for approximating rational Bézier curve using Bézier curves

Computer Aided Geometric Design
Multi-degree reduction of Bézier curves with constraints, using dual Bernstein basis polynomials

Computer Aided Geometric Design
High order approximation of rational curves by polynomial curves

Computer Aided Geometric Design
Weighted progressive iteration approximation and convergence analysis

Computer Aided Geometric Design
Constrained approximation of rational Bézier curves based on a matrix expression of its end points continuity condition

Computer-Aided Design
Sample-based polynomial approximation of rational Bézier curves

Journal of Computational and Applied Mathematics

Approximating uniform rational B-spline curves by polynomial B-spline curves

Journal of Computational and Applied Mathematics
Construction of dual bases

Journal of Computational and Applied Mathematics
Construction of dual B-spline functions

Journal of Computational and Applied Mathematics

Quantified Score

Hi-index	0.00

Visualization

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.