Implicitization using moving curves and surfaces
SIGGRAPH '95 Proceedings of the 22nd annual conference on Computer graphics and interactive techniques
The moving line ideal basis of planar rational curves
Computer Aided Geometric Design
On the minors of the implicitization Bézout matrix for a rational plane curve
Computer Aided Geometric Design
The mu-basis of a rational ruled surface
Computer Aided Geometric Design
A new implicit representation of a planar rational curve with high order singularity
Computer Aided Geometric Design
The µ-basis of a planar rational curve: properties and computation
Graphical Models
Revisiting the µ-basis of a rational ruled surface
Journal of Symbolic Computation
Computation of the singularities of parametric plane curves
Journal of Symbolic Computation
Computing singular points of plane rational 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
The μ-basis and implicitization of a rational parametric surface
Journal of Symbolic Computation
Using a bihomogeneous resultant to find the singularities of rational space curves
Journal of Symbolic Computation
Hi-index | 0.00 |
In this paper, we discuss the singularities of rational space curves. Two methods are provided to compute the singularities of arbitrary degree curves. These methods are a generalization of the paper (Chen, Wang and Liu. Computing singular points of plane rational curves. Journal of Symbolic Computation 43, 92--117, 2008), which are based on the μ-basis of the rational space curve and on random technique. The μ-basis induces a matrix M which contains all the information about the singularities including the parameter values corresponding to the singularities, multiplicities and infinitely near singularities. These information can be obtained by computing the Smith form of the matrix M. We compare our methods with previous approaches such as generalized resultants, and provide some examples to illustrate the effectiveness of our methods.