On the stability of transformations between power and Bernstein polynomial forms
Computer Aided Geometric Design
Algorithms for intersecting parametric and algebraic curves I: simple intersections
ACM Transactions on Graphics (TOG)
On the optimal stability of the Bernstein basis
Mathematics of Computation
Accuracy and Stability of Numerical Algorithms
Accuracy and Stability of Numerical Algorithms
Theoretical Computer Science - Algebraic and numerical algorithm
Intersection and self-intersection of surfaces by means of Bezoutian matrices
Computer Aided Geometric Design
A unified approach to resultant matrices for Bernstein basis polynomials
Computer Aided Geometric Design
Division algorithms for Bernstein polynomials
Computer Aided Geometric Design
Subdivision methods for solving polynomial equations
Journal of Symbolic Computation
| Hi-index | 0.00 |
We study the Bezier curve-surface and Bezier surface-surface intersection problems avoiding the well-known unstable conversion between the Bernstein basis and the power basis. These varieties are given by parameterizations in Bernstein bases and all intermediate computations are performed in that form. For this purpose we construct an adapted resultant for generic Bernstein polynomial systems with a special shape which appear in the intersection problems. This construction is based on the expression of the Bezoutian matrix in Bernstein form.