Fast multidimensional Bernstein-Lagrange algorithms

Joanna Kapusta, Ryszard Smarzewski

Abstract


In this paper we present two fast algorithms for the Bézier curves and surfaces of an arbitrary dimension. The first algorithm evaluates the Bernstein-Bézier curves and surfaces at a set of specific points by using the fast Bernstein-Lagrange transformation. The second algorithm is an inversion of the first one. Both algorithms reduce the initial problem to computation of some discrete Fourier transformations in the case of geometrical subdivisions of the d-dimensional cube. Their orders of computational complexity are proportional to those of corresponding d-dimensional FFT-algorithm, i.e. to O (N logN) + O (dN), where N denotes the order of the Bernstein-Bézier curves.

Full Text:

PDF


DOI: http://dx.doi.org/10.2478/v10065-012-0002-6
Date of publication: 2012-01-01 00:00:00
Date of submission: 2016-04-28 09:07:37


Statistics


Total abstract view - 654
Downloads (from 2020-06-17) - PDF - 0

Indicators



Refbacks

  • There are currently no refbacks.


Copyright (c) 2015 Annales UMCS Sectio AI Informatica

Creative Commons License
This work is licensed under a Creative Commons Attribution 4.0 International License.