A matrix-based approach to properness and inversion problems for rational surfaces (Q857880): Difference between revisions

From MaRDI portal
RedirectionBot (talk | contribs)
Removed claim: reviewed by (P1447): Item:Q321279
RedirectionBot (talk | contribs)
Changed an Item
Property / reviewed by
 
Property / reviewed by: Josef Schicho / rank
 
Normal rank

Revision as of 06:23, 13 February 2024

scientific article
Language Label Description Also known as
English
A matrix-based approach to properness and inversion problems for rational surfaces
scientific article

    Statements

    A matrix-based approach to properness and inversion problems for rational surfaces (English)
    0 references
    0 references
    0 references
    5 January 2007
    0 references
    There are several algorithms for implicitizing rational surfaces (given parametrically) that use, as an intermediate step, a matrix with polynomial entries. The paper mentions the method of ``moving surfaces'', originally introduced in \textit{F. Chen, T. Sederberg} [``Implicitization using moving curves and surfaces,'' Comp. Graph. Ann. Conf., 301--308 (1995)] and extended in \textit{W. A. Adkins, J. W. Hoffmann, H. H. Wang} [``Equations of parametric surfaces with base points via syzygies,'' J. Symb. Comput. 39 (1), 73--101 (2005)], \textit{L. Buse, D. Cox, C. D'Andrea} [J. Algebra Appl. 2 (2),189--214 (2003; Zbl 1068.14066)], \textit{D. Cox, R. Goldman, M. Zhang} [J. Symb. Comput. 29 (3), 419--440 (2000; Zbl 0959.68124)], \textit{C. D'Andrea, A. Khetan} [J. Algebra 303, 543--565 (2006; Zbl 1115.14028)], as well as \textit{F. Aries, R. Senoussi} [J. Symb. Comput. 31 (4), 357--365 (2001; Zbl 0981.14030)], \textit{L. Buse, M. Elkadi, B. Mourrain} [in: Topics in Algebraic Geometry and Geometric Modeling, Contemp. Math. 334, 221--242 (2003; Zbl 1036.14500)], \textit{C. D'Andrea, I. Emiris} [J. Symb. Comput. 33 (5), 587--608 (2002; Zbl 1021.65024)], \textit{A. Dickenstein, I. Emiris} [J. Symb. Comput. 36, 317--342 (2003; Zbl 1095.13547)], \textit{J.-P. Jouanolou} [Adv. Math. 126 (2), 119--250 (1997; Zbl 0882.13008)], and \textit{R. Goldman, A. Khetan, N. Song} [in: Proc. 2004 int. symp. symbolic and algebraic computation, Santander, Spain 2004, 205--2122 (2004; Zbl 1134.13312)]. Here the authors introduce a general concept, called implicitization matrix, which generalizes the matrices arising in the algorithms above. They also give a simple method, once this matrix is known, of how to decide whether the parametrization is proper or not, and how to construct an inversion formula in the affirmative case.
    0 references
    0 references
    implicitization
    0 references
    resultant
    0 references
    inversion
    0 references
    0 references