On computing Bézier curves by Pascal matrix methods

Details On computing Bézier curves by Pascal matrix methods On computing Bézier curves by Pascal matrix methods

2010-06-22

arxiv.org/abs/1006.4327v1

Mathematics

Numerical Analysis

16 pages, 1 figure

Scientific paper

The main goal of the paper is to introduce methods which compute B\'ezier curves faster than Casteljau's method does. These methods are based on the spectral factorization of a $n\times n$ Bernstein matrix, $B^e_n(s)= P_nG_n(s)P_n^{-1}$, where $P_n$ is the $n\times n$ lower triangular Pascal matrix. So we first calculate the exact optimum positive value $t$ in order to transform $P_n$ in a scaled Toeplitz matrix, which is a problem that was partially solved by X. Wang and J. Zhou (2006). Then fast Pascal matrix-vector multiplications and strategies of polynomial evaluation are put together to compute B\'ezier curves. Nevertheless, when $n$ increases, more precise Pascal matrix-vector multiplications allied to affine transformations of the vectors of coordinates of the control points of the curve are then necessary to stabilize all the computation.

Affiliated with

Also associated with

No associations

Rating

On computing Bézier curves by Pascal matrix methods does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with On computing Bézier curves by Pascal matrix methods, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and On computing Bézier curves by Pascal matrix methods will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-108537