Vandermonde factorizations of a regular Hankel matrix and their application on the computation of Bézier curves
Licio H. Bezerra
Abstract
Open-access reader
Licio H. Bezerra
Abstract
Open-access reader
In this paper, a new method to compute a Bézier curve of degree n = 2m-1 is introduced, here formulated as a set of points whose coordinates are calculated from two Hankel forms in $\C^m$. From Vandermonde factorizations of the two associated Hankel matrices $H_x$ and $H_y$, the Hankel forms can be easily calculated, thus yielding points on the Bézier curve. Here, a new proof of the existence of a Vandermonde factorization of regular Hankel matrix is given from Pascal matrices techniques. But, even when the Hankel matrix associated to the form is singular, the method can still be used by shifting its skew-diagonal and counteracting it after, which is pratically done without costs.. By comparing this new method with a Pascal matrix method and Casteljau's, we see that the results suggest that this new method is very effective with regard to accuracy and time of computation for various values of n.
A significance statement is not available in the OpenAlex record.
A contribution statement is not available in the OpenAlex record.
Method details are not available in the OpenAlex metadata.
Findings are not separately available in the OpenAlex metadata.
Limitations are not available in the OpenAlex metadata.
Application details are not available in the OpenAlex metadata.
In this paper, a new method to compute a Bézier curve of degree n = 2m-1 is introduced, here formulated as a set of points whose coordinates are calculated from two Hankel forms in $\C^m$. From Vandermonde factorizations of the two associated Hankel matrices $H_x$ and $H_y$, the Hankel forms can be easily calculated, thus yielding points on the Bézier curve. Here, a new proof of the existence of a Vandermonde factorization of regular Hankel matrix is given from Pascal matrices techniques. But, even when the Hankel matrix associated to the form is singular, the method can still be used by shifting its skew-diagonal and counteracting it after, which is pratically done without costs.. By comparing this new method with a Pascal matrix method and Casteljau's, we see that the results suggest that this new method is very effective with regard to accuracy and time of computation for various values of n.
Key concepts: Vandermonde matrix, Hankel matrix, Mathematics, Computation, Pascal (unit), Matrix (chemical analysis), Factorization, Algebra over a field