On the greatest common divisor of polynomials which depend on a parameter
ISSAC '93 Proceedings of the 1993 international symposium on Symbolic and algebraic computation
An efficient method for analyzing the topology of plane real algebraic curves
Selected papers presented at the international IMACS symposium on Symbolic computation, new trends and developments
Polynomial Algorithms in Computer Algebra
Polynomial Algorithms in Computer Algebra
Efficient topology determination of implicitly defined algebraic plane curves
Computer Aided Geometric Design
Plotting missing points and branches of real parametric curves
Applicable Algebra in Engineering, Communication and Computing
A delineability-based method for computing critical sets of algebraic surfaces
Journal of Symbolic Computation
Fast and exact geometric analysis of real algebraic plane curves
Proceedings of the 2007 international symposium on Symbolic and algebraic computation
Computation of the singularities of parametric plane curves
Journal of Symbolic Computation
Topology of real algebraic space curves
Journal of Symbolic Computation
On the computation of the topology of a non-reduced implicit space curve
Proceedings of the twenty-first international symposium on Symbolic and algebraic computation
Detecting real singularities of a space curve from a real rational parametrization
Journal of Symbolic Computation
On the different shapes arising in a family of plane rational curves depending on a parameter
Computer Aided Geometric Design
Computation of the topology of real algebraic space curves
Journal of Symbolic Computation
Topology of 2D and 3D rational curves
Computer Aided Geometric Design
| Hi-index | 0.00 |
In a previous work (Alcazar, 2009) we addressed the problem of determining the topology types arising in a family of plane rational curves depending on one parameter, defined by means of a rational parametrization. In this paper, starting from the ideas in Alcazar (2009) we address the analogous problem for families of space rational curves, also defined by means of a rational parametrization. Hence, the main result in the paper is an algorithm for computing the (finitely many) real values of the parameter where the topology of the family may change. The algorithm has been implemented in the computer algebra system Maple 13, with good practical results; several examples and timings are provided.