Efficient computation of Bézier curves from their Bernstein-Fourier representation

DOI10.1016/j.amc.2013.05.079zbMath1329.65048OpenAlexW1970404708MaRDI QIDQ902498

Licio Hernanes Bezerra

Publication date: 18 January 2016

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

Full work available at URL: https://doi.org/10.1016/j.amc.2013.05.079

zbMATH Keywords

FFTVandermonde matrixBézier curveBernstein matrix

Mathematics Subject Classification ID

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

Related Items (3)

Accurate evaluation of Bézier curves and surfaces and the Bernstein-Fourier algorithm ⋮ Fast and accurate evaluation of dual Bernstein polynomials ⋮ Dynamic Evaluation of Exponential Polynomial Curves and Surfaces via Basis Transformation

Uses Software

• CONSURF

Cites Work

• On computing Bézier curves by Pascal matrix methods
• Efficient evaluation of multivariate polynomials
• A shape preserving representation with an evaluation algorithm of linear complexity
• Vandermonde Factorizations of a Regular Hankel Matrix and Their Application to the Computation of Bézier Curves
• A generalized Ball curve and its recursive algorithm

This page was built for publication: Efficient computation of Bézier curves from their Bernstein-Fourier representation