Implicitization of hypersurfaces

We present new, practical algorithms for the hypersurface implicitization problem: namely, given a parametric description (in terms of polynomials or rational functions) of the hypersurface, find its implicit equation. Two of them are for polynomial parametrizations: one algorithm, “ElimTH”, has as...

Celý popis

Uloženo v:
Podrobná bibliografie
Vydáno v:Journal of symbolic computation Ročník 81; s. 20 - 40
Hlavní autoři: Abbott, John, Bigatti, Anna Maria, Robbiano, Lorenzo
Médium: Journal Article
Jazyk:angličtina
Vydáno: Elsevier Ltd 01.07.2017
Témata:
Hypersurface
Implicitization
68W30
Hypersurface
Implicitization
13-04
14Q10
13P10
13P25
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!
Popis
Shrnutí:We present new, practical algorithms for the hypersurface implicitization problem: namely, given a parametric description (in terms of polynomials or rational functions) of the hypersurface, find its implicit equation. Two of them are for polynomial parametrizations: one algorithm, “ElimTH”, has as main step the computation of an elimination ideal via a truncated, homogeneous Gröbner basis. The other algorithm, “Direct”, computes the implicitization directly using an approach inspired by the generalized Buchberger–Möller algorithm. Either may be used inside the third algorithm, “RatPar”, to deal with parametrizations by rational functions. Finally we show how these algorithms can be used in a modular approach, algorithm “ModImplicit”, for avoiding the high costs of arithmetic with rational numbers. We exhibit experimental timings to show the practical efficiency of our new algorithms.
ISSN:0747-7171
1095-855X
DOI:10.1016/j.jsc.2016.11.002