论文信息 - Mu-bases for Polynomial Systems in One Variable

Mu-bases for Polynomial Systems in One Variable

The notion of a @m-basis for an arbitrary number of polynomials in one variable is defined. The basic properties of these @m-bases are derived, and an algorithm is presented based on Gaussian Elimination to calculate a @m-basis for any collection of univariate polynomials. These @m-bases are then applied to solve implicitization, inversion and intersection problems for rational space curves. Systems where base points are present are also discussed.

Ron Goldman | Ning Song

[1] Falai Chen,et al. The µ-basis of a planar rational curve: properties and computation , 2002 .

[2] Ron Goldman,et al. Axial moving lines and singularities of rational planar curves , 2007, Comput. Aided Geom. Des..

[3] Falai Chen,et al. The moving line ideal basis of planar rational curves , 1998, Comput. Aided Geom. Des..

[4] Falai Chen,et al. A new implicit representation of a planar rational curve with high order singularity , 2002, Comput. Aided Geom. Des..

[5] Thomas W. Sederberg,et al. Curve implicitization using moving lines , 1994, Comput. Aided Geom. Des..

[6] Ron Goldman,et al. Implicitizing Rational Curves by the Method of Moving Algebraic Curves , 1997, J. Symb. Comput..

[7] Falai Chen,et al. Implicitization using moving curves and surfaces , 1995, SIGGRAPH.

[8] Ron Goldman,et al. On the Validity of Implicitization by Moving Quadrics for Rational Surfaces with No Base Points , 2000, J. Symb. Comput..