Rectangular corner cutting and Sylvester A-resultants

ABSTRACT

We present a way to construct the Sylvester A-resultant matrix for three bi-degree (m, n) polynomials whose Newton polygon is modified by cutting off rectangles at the corners. We also show that the determinant of this matrix is generically non-singular, so this determinant is indeed the resultant of the three original bivariate polynomials.

REFERENCES

• 1: E. B~zout. Th~orie G~n~rale des t~quations Alg~briques. Paris, 1779.
• 2: D. Cox, J. Little, D. O'Shea. Using Algebraic Geometry. Springer-Verlag New York, Inc., 1998.
• 3: Eng-wee Chionh, Base points, resultants, and the implicit representation of rational surfaces, University of Waterloo, Waterloo, Ont., Canada, 1990
• 4: Eng-Wee Chionh, Rectangular corner cutting and Dixon A -resultants, Journal of Symbolic Computation, v.31 n.6, p.651-669, June 2001 [doi>10.1006/jsco.2001.0448]
• 5: Eng-Wee Chionh , Ming Zhang , Ronald N. Goldman, Implicitization by Dixon A-Resultants, Proceedings of the Geometric Modeling and Processing 2000, p.310, April 10-12, 2000
• 6: E..W. Chionh, M. Zhang, R. N. Goldman. The Block Structure of Three Dixon Resultants and Their Accompanying Transformation Matrices. Technical Report TR99-341, Department of Computer Science, Rice University, 1999.
• 7: A. L. Dixon. The Eliminant of Three Quantics in Two Independent Variables. Proc. London Mathematics Society, 6:49-69,473-492, 1908.
• 8: Ioannis Z. Emiris , Bernard Mourrain, Matrices in elimination theory, Journal of Symbolic Computation, v.28 n.1-2, p.3-44, July/Aug. 1999 [doi>10.1006/jsco.1998.0266]
• 9: I. M. Gelfand, M. Kapranov, A. Zelevinsky. Discriminants~ Resultants~ and Multidimensional Determinants. Birkhauser, Boston-Basel-Berlin, 1994.
• 10: B. Sturmfels. Introduction to Resultants. Applications of Computational Algebraic Geometry, Lecture Notes, American Mathematical Society Short Course Series, 1997.
• 11: J. Warren. A Bound on the Implicit Degree of Polygonal Bezier Surfaces. Algebraic Geometry and Its Applications, edited by C. Bajaj, Springer-Verlag Inc., New York, 513-525, 1994.
• 12: S. Zube. The n-sided Toric Patches and A-resultants. Submitted to Computer Aided Geometric Design, 1999.

INDEX TERMS

Primary Classification:
  F. Theory of Computation
  F.2 ANALYSIS OF ALGORITHMS AND PROBLEM COMPLEXITY
      F.2.1 Numerical Algorithms and Problems
          Subjects: Computations on polynomials

Additional Classification:
  I. Computing Methodologies
  I.1 SYMBOLIC AND ALGEBRAIC MANIPULATION
      I.1.2 Algorithms
          Subjects: Algebraic algorithms

General Terms:
Algorithms, Theory, Verification