An implicitization algorithm for rational surfaces with no base points
From MaRDI portal
Publication:5933498
DOI10.1006/jsco.1999.0436zbMath0981.14030OpenAlexW2069497227MaRDI QIDQ5933498
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
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
This page was built for publication: An implicitization algorithm for rational surfaces with no base points