A Linear Complexity Algorithm for the Bernstein Basis

J. Delgado; J.M. Peña

doi:10.1109/GMAG.2003.1219682

Geometric Modeling and Graphics, International Conference on

A Linear Complexity Algorithm for the Bernstein Basis

Year: 2003, Pages: 162

DOI Bookmark: 10.1109/GMAG.2003.1219682

Authors

J. Delgado, Universidad de Zaragoza
J.M. Peña, Universidad de Zaragoza

Abstract

In this paper we obtain a new corner cutting algorithm for the evaluation of polynomials represented in the Bernstein-Bezier form. This algorithm has linear time complexity, in contrast to the quadratic time complexity of the usual de Casteljau algorithm.

Like what you’re reading?

Already a member?

Get this article FREE with a new membership!

Accurate depth approximation through Bezier-Bernstein polynomial for 3D cameras
2009 Digest of Technical Papers International Conference on Consumer Electronics
Airfoil Aerodynamic Optimization Based on an Improved Genetic Algorithm
2014 Fifth International Conference on Intelligent Systems Design and Engineering Applications (ISDEA)
The Novel Stochastic Bernstein Method of Functional Approximation
First NASA/ESA Conference on Adaptive Hardware and Systems
The Fractal Nature of Bezier Curves
Geometric Modeling and Processing
Poisson approximation
Proceedings Geometric Modeling and Processing 2000. Theory and Applications
Resolution enhancement of ROI from surveillance video using Bernstein interpolation
2011 8th IEEE International Conference on Advanced Video and Signal Based Surveillance (AVSS)
Parallel Schemes of Computation for Bernstein Coefficients and Their Application
International Conference on Parallel Computing in Electrical Engineering (PARELEC'02)
Approximating Handwritten Curve by Using Progressive-Iterative Approximation
2013 10th International Conference Computer Graphics, Imaging and Visualization (CGIV)
Low Complexity Cubing and Cube Root Computation over Z_$\F_{3^m}$_Z in Polynomial Basis
IEEE Transactions on Computers
Quantum Attacks without Superposition Queries: the Offline Bernstein-Vazirani Meets Grover Algorithm
2023 2nd International Conference on Computing, Communication, Perception and Quantum Technology (CCPQT)

A Linear Complexity Algorithm for the Bernstein Basis

Authors

Abstract

Related Articles