Implicitization of hypersurfaces

From MaRDI portal



Abstract: 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 extit{truncated, homogeneous} Gr"obner basis. The other algorithm, "Direct", computes the implicitization directly using an approach inspired by the generalized Buchberger-M"oller 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.


The paper describes implementation details of four common tricks that can be used to speed up the computation of implicitization: 1. When eliminating to find a hypersurfsce, stop computing the Gröbner Basis once you have the result. 2. Searching for the coefficients of the hypersurface by searching for relations among the images of monomials. 3. Homogenization before elimination. 4. Modular arithmetic and rational reconstruction. The authors also report on timings of their implementation and give references to their own work. Additionally the paper suggests some new vocabulary for commutative algebra. For example, a monomial is called a power product, a well order is called an enumerative order, an elimination ideal is an eliminating ideal and so on.





Describes a project that uses

Uses Software






This page was built for publication: Implicitization of hypersurfaces

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q504409)