Using \(\mu \)-bases to reduce the degree in the computation of projective equivalences between rational curves in \(n\)-space (Q2161083)

The authors present a new technique of digitally describing rational curves in \(\mathbb{R}^n\) based \(\mu\)-bases, intending to reduce the cost of computation and the complexity of calculus. It is proved that the computation of projective equivalences between two rational curves can be transferred to the curves of minimal degree belonging to the \(\mu\)-basis of the given curves. A new algorithm for computing \(\mu\)-basis of rational curves is described. It is useful in computing the elements of the \(\mu\)-basis by increasing degree. In particular, one can compute the elements of minimal degree of the \(\mu\)-basis, if necessary, without computing the whole \(\mu\)-basis. First of all the plane case is studied extending it to the case of curves in \(\mathbb{R}^n\). New results referring to the degrees of the elements in the \(\mu\)-basis are proved. Numerical examples are presented.