Abstract
AbstractGiven a unirational parameterization of a surface, we present a general algorithm to determine a birational parameterization without using parameterization algorithms. Additionally, if the surface is assumed to have a birational parameterization with empty base locus, and the input parameterization is transversal, the degree of the solution is determined in advance and the dimension of the space of solutions is reduced. As a consequence, for these cases, we present a second faster algorithm.
Funder
Ministerio de Ciencia e Innovación
Universidad de Alcalá
Publisher
Springer Science and Business Media LLC
Reference20 articles.
1. Andradas, C., Recio, T., Sendra, J.R., Tabera, L.F.: On the simplication of the coefficients of a parametrization. J. Symb. Comput. 44, 192–210 (2009)
2. Cox, D., Little, J., O’Shea, D.: Ideals, Varieties, and Algorithms: An Introduction to Computational Algebraic Geometry and Commutative Algebra. Springer, Berlin (2013)
3. Cox, D.A., Pérez-Díaz, S., Sendra, J.R.: On the base point locus of surface parametrizations: formulas and consequences. Commun. Math. Stat. 10, 757–783 (2020)
4. A First Course;J Harris,1995
5. Laplagne, S.: An algorithm for the computation of the radical of an ideal. ISSAC 2006, pp. 191–195. ACM Press (2006)