Algorithms for polynomials in Bernstein form

From MaRDI portal





The aim of this paper is to investigate the aspects of the formulation of geometric modeling algorithms in the Bernstein polynomial basis. Bernstein forms for various basic polynomial procedures required in such algorithms are developed and are found to be of similar complexity to their customary power forms. The condition of computation in floating point arithmetic of the power and Bernstein formulations is also examined.



Cites work


Cited in
(only showing first 100 items - show all)








This page was built for publication: Algorithms for polynomials in Bernstein form

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