A univariate resultant-based implicitization 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...
Uloženo v:
| Vydáno v: | Journal of symbolic computation Ročník 43; číslo 2; s. 118 - 139 |
|---|---|
| Hlavní autoři: | , |
| Médium: | Journal Article |
| Jazyk: | angličtina |
| Vydáno: |
Elsevier Ltd
01.02.2008
|
| Témata: | |
| ISSN: | 0747-7171, 1095-855X |
| On-line přístup: | Získat plný text |
| Tagy: |
Přidat tag
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
|
| Shrnutí: | 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. |
|---|---|
| ISSN: | 0747-7171 1095-855X |
| DOI: | 10.1016/j.jsc.2007.10.001 |