The μ-basis and implicitization of a rational parametric surface

  • Authors:
  • Falai Chen;David Cox;Yang Liu

  • Affiliations:
  • Department of Mathematics, University of Science and Technology of China, Hefei, Anhui 230026, PR China;Department of Mathematics and Computer Science, Amherst College, Amherst, MA 01002, USA;Department of Computer Science and Information System, University of Hong Kong, Hong Kong, China

  • Venue:
  • Journal of Symbolic Computation
  • Year:
  • 2005

Quantified Score

Hi-index 0.00

Visualization

Abstract

The concept of a @m-basis was introduced in the case of parametrized curves in 1998 and generalized to the case of rational ruled surfaces in 2001. The @m-basis can be used to recover the parametric equation as well as to derive the implicit equation of a rational curve or surface. Furthermore, it can be used for surface reparametrization and computation of singular points. In this paper, we generalize the notion of a @m-basis to an arbitrary rational parametric surface. We show that: (1) the @m-basis of a rational surface always exists, the geometric significance of which is that any rational surface can be expressed as the intersection of three moving planes without extraneous factors; (2) the @m-basis is in fact a basis of the moving plane module of the rational surface; and (3) the @m-basis is a basis of the corresponding moving surface ideal of the rational surface when the base points are local complete intersections. As a by-product, a new algorithm is presented for computing the implicit equation of a rational surface from the @m-basis. Examples provide evidence that the new algorithm is superior than the traditional algorithm based on direct computation of a Grobner basis. Problems for further research are also discussed. is a basis of the corresponding moving surface ideal of the rational surface when the base points are local complete intersections. As a by-product, a new algorithm is presented for computing the implicit equation of a rational surface from the @m-basis. Examples provide evidence that the new algorithm is superior than the traditional algorithm based on direct computation of a Grobner basis. Problems for further research are also discussed.