On computing Bézier curves by Pascal matrix methods

DOI10.1016/J.AMC.2011.05.007MaRDI QIDQ555438zbMATH OpenOpenAlexFDO

Authors Licio H. Bezerra, Leonardo Koller Sacht

Publication date 22 July 2011

Published in Applied Mathematics and Computation (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/1006.4327

zbMATH Keywords

Bernstein polynomialBézier curvePascal matrixToeplitz matrix

Mathematics Subject Classification ID

Computer-aided design (modeling of curves and surfaces) (65D17)

Abstract: 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 $nimesn$ Bernstein matrix, $B_n^e(s)=P_n{G}_n(s)P_n^{-1}$, where $P_n$ is the $nimesn$ 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.

Recommendations

• Efficient computation of Bézier curves from their Bernstein-Fourier representation
• On de Casteljau-type algorithms for rational Bézier curves
• Matrix representation for multi-degree reduction of Bézier curves
• scientific article; zbMATH DE number 5283362
• Fast computation of determinants of Bézout matrices and application to curve implicitization
• Approximate merging of Bézier curves with generalized inverse matrices
• A unified matrix representation for degree reduction of Bézier curves
• Computing Tight Bounds for a Bézier Curve
• Bézier curves and surfaces based on modified Bernstein polynomials

Cites work

• A fast eigenvalue algorithm for Pascal matrices
• Efficient algorithms for Bézier curves
• scientific article; zbMATH DE number 3397374 (Why is no real title available?)
• On de Casteljau's algorithm
• Pascal's Matrices
• The Matrices of Pascal and Other Greats

Cited in

(7)

• Matrix methods for the simplicial Bernstein representation and for the evaluation of multivariate polynomials
• Matrix methods for the tensorial Bernstein form
• Vandermonde factorizations of a regular Hankel matrix and their application to the computation of Bézier curves
• scientific article; zbMATH DE number 962453 (Why is no real title available?)
• A comprehensive comparison of algorithms for evaluating rational Bézier curves
• Bernstein-Bezoutian matrices and curve implicitization
• Efficient computation of Bézier curves from their Bernstein-Fourier representation

This page was built for publication: On computing Bézier curves by Pascal matrix methods

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q555438)