On Euclid's Algorithm and the Computation of Polynomial Greatest Common Divisors
Journal of the ACM (JACM)
Computational Geometry for Design and Manufacture
Computational Geometry for Design and Manufacture
On square-free decomposition algorithms
SYMSAC '76 Proceedings of the third ACM symposium on Symbolic and algebraic computation
Curves with rational chord-length parametrization
Computer Aided Geometric Design
Complex rational Bézier curves
Computer Aided Geometric Design
Local parametrization of cubic surfaces
Journal of Symbolic Computation
Letter to the editor: On the conditions for the coincidence of two cubic Bézier curves
Journal of Computational and Applied Mathematics
Hi-index | 0.00 |
This paper discusses two degenerate cases of polynomial parametric curves for which the degrees of the defining polynomials can be reduced without altering the curve. The first case is the improperly parametrized curve for which each point on the curve corresponds to several parameter values. The second case, which can only occur for rational polynomial parametric curves, exists when the defining polynomials all have a common factor. This paper describes how to detect and correct each type of degeneracy. Examples are given which demonstrate that seemingly innocuous Bezier curves may suffer from either of these degeneracies.