The moving line ideal basis of planar rational curves
Computer Aided Geometric Design
Symbolic and numeric methods for exploiting structure in constructing resultant matrices
Journal of Symbolic Computation
Multihomogeneous resultant formulae by means of complexes
Journal of Symbolic Computation - Special issue: International symposium on symbolic and algebraic computation (ISSAC 2002)
Computation of the singularities of parametric plane curves
Journal of Symbolic Computation
μ-bases for polynomial systems in one variable
Computer Aided Geometric Design
Axial moving planes and singularities of rational space curves
Computer Aided Geometric Design
Detecting real singularities of a space curve from a real rational parametrization
Journal of Symbolic Computation
μ-Bases and singularities of rational planar curves
Computer Aided Geometric Design
Computing the singularities of rational space curves
Proceedings of the 2010 International Symposium on Symbolic and Algebraic Computation
Matrix-based implicit representations of rational algebraic curves and applications
Computer Aided Geometric Design
Hi-index | 0.00 |
We provide a new technique to detect the singularities of rational space curves. Given a rational parametrization of a space curve, we first compute a @m-basis for the parametrization. From this @m-basis we generate three planar algebraic curves of different bidegrees whose intersection points correspond to the parameters of the singularities. To find these intersection points, we construct a new sparse resultant matrix for these three bivariate polynomials. We then compute the parameter values corresponding to the singularities by applying Gaussian elimination to this resultant matrix. Let @n"Q denote the multiplicity of the singular point Q, and let n be the degree of the curve. We find that when @?@n"Q=