An implicitization algorithm for rational surfaces with no base points

DOI10.1006/jsco.1999.0436zbMath0981.14030OpenAlexW2069497227MaRDI QIDQ5933498

Rachid Senoussi, Franck Aries

Publication date: 7 March 2002

Published in: Journal of Symbolic Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1006/jsco.1999.0436

zbMATH Keywords

parametrizationelimination theoryimplicitizationrational surfaceSylvester resultant

Mathematics Subject Classification ID

Rational and ruled surfaces (14J26) Computational aspects of algebraic surfaces (14Q10)

Related Items (12)

A study of a family of monomial ideals ⋮ Parallel computation of determinants of matrices with polynomial entries ⋮ Resultants for unmixed bivariate polynomial systems produced using the Dixon formulation ⋮ A matrix-based approach to properness and inversion problems for rational surfaces ⋮ On the closed image of a rational map and the implicitization problem. ⋮ The implicit equation of a multigraded hypersurface ⋮ Implicitization, parameterization and singularity computation of Steiner surfaces using moving surfaces ⋮ Hybrid sparse resultant matrices for bivariate polynomials ⋮ An effective algorithm of computing symbolic determinants with multivariate polynomial entries ⋮ Implicitization of rational surfaces using toric varieties ⋮ An effective hybrid algorithm for computing symbolic determinants ⋮ Implicitization of rational surfaces by means of polynomial interpolation

Cites Work

• Algorithm for implicitizing rational parametric surfaces
• Degree, multiplicity, and inversion formulas for rational surfaces using \(u\)-resultants
• The algebra and geometry of Steiner and other quadratically parametrizable surfaces
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: An implicitization algorithm for rational surfaces with no base points