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

This paper presents a new method of computation of Bézier curves of any order. This method is based on the Bernstein-Fourier representation of a Bézier curve and utilizes Fast Fourier Transforms to change from the Bernstein basis to a new one that provides efficient computation. For 2⩽n⩽8, where n is the number of control points, this method is still more rapid than the VS method, which is already very fast.