A univariate resultant based implicitation algorithm for surfaces
In this paper, we present a new algorithm for computing the implicit equation of a rational surface V from a rational parametrization P(t). The algorithm is valid independent of the existence of base points, and is based on the computation of polynomial gcds and univariate resultants. Moreover, we p...
| Autores: | , |
|---|---|
| Tipo de recurso: | artículo |
| Fecha de publicación: | 2008 |
| País: | España |
| Institución: | Universidad de Alcalá (UAH) |
| Repositorio: | e_Buah Biblioteca Digital Universidad de Alcalá |
| Idioma: | inglés |
| OAI Identifier: | oai:ebuah.uah.es:10017/49595 |
| Acceso en línea: | http://hdl.handle.net/10017/49595 https://dx.doi.org/10.1016/j.jsc.2007.10.001 |
| Access Level: | acceso abierto |
| Palabra clave: | Implicitization Rational surface parametrization Partial degrees Properness Matemáticas Mathematics |
| Sumario: | In this paper, we present a new algorithm for computing the implicit equation of a rational surface V from a rational parametrization P(t). The algorithm is valid independent of the existence of base points, and is based on the computation of polynomial gcds and univariate resultants. Moreover, we prove that the resultant-based formula provides a power of the implicit equation. In addition, performing a suitable linear change of parameters, we prove that this power is indeed the degree of the rational map induced by the parametrization. We also present formulas for computing the partial degrees of the implicit equation. |
|---|