Algorithms for polynomials in Bernstein form

1988/06/01 by R.T. Farouki, Rida T. Farouki, V.T. Rajan +1 · 12 citations
Computer Science · Engineering · Mathematics · #Advanced Numerical Analysis Techniques #Iterative Methods for Nonlinear Equations #Numerical Methods and Algorithms

paper · doi:10.1016/0167-8396(88)90016-7

openalex publication_date 1988/06/01 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28

Citations

• Comparison of three curve intersection algorithms

Cited by

• Counterexamples to the conjecture of the upper bound of the derivative of a rational Bézier curve
• Identification and “reverse engineering” of Pythagorean-hodograph curves
• Algorithms and Identities for B\acuteezier curves via Post Quantum Blossom
• On the explicit representation of orthonormal Bernstein polynomials
• Hybrid Bernstein Normalizing Flows for Flexible Multivariate Density Regression with Interpretable Marginals
• Optimal parameterizations
• Bezier curves and surfaces based on modified Bernstein polynomials
• Biconvex Optimization for Smooth Minimum-Time Trajectories around Convex Obstacles
• The Bernstein polynomial basis: A centennial retrospective
• A biconvex method for minimum-time motion planning through sequences of convex sets
• Transformation of Chebyshev–Bernstein Polynomial Basis
• Integrals of Bernstein polynomials: An application for the solution of high even-order differential equations