Degree, multiplicity, and inversion formulas for rational surfaces using u-resultants
Computer Aided Geometric Design
Symbolic parametrization of curves
Journal of Symbolic Computation
On the Newton Polytope of the Resultant
Journal of Algebraic Combinatorics: An International Journal
Rational parametrizations of algebraic curves using a canonical divisor
Journal of Symbolic Computation - Special issue: parametric algebraic curves and applications
A subdivision-based algorithm for the sparse resultant
Journal of the ACM (JACM)
Residual resultant over the projective plane and the implicitization problem
Proceedings of the 2001 international symposium on Symbolic and algebraic computation
Hybrid sparse resultant matrices for bivariate polynomials
Journal of Symbolic Computation - Computer algebra: Selected papers from ISSAC 2001
Resultants of skewly composed polynomials
Proceedings of the 2006 international symposium on Symbolic and algebraic computation
Intersection and self-intersection of surfaces by means of Bezoutian matrices
Computer Aided Geometric Design
Solving over-determined systems by the subresultant method (with an appendix by Marc Chardin)
Journal of Symbolic Computation
A computational study of ruled surfaces
Journal of Symbolic Computation
Computer Aided Geometric Design
Algebraic and numerical algorithms
Algorithms and theory of computation handbook
Computing hypercircles by moving hyperplanes
Journal of Symbolic Computation
Hi-index | 0.00 |
We present a subresultant-based algorithm for deciding if the parametrization of a toric hypersurface is invertible or not, and for computing the inverse of the parametrization in the case where it exists. The algorithm takes into account the monomial structure of the input polynomials.