Implicitization of hypersurfaces

DOI10.1016/J.JSC.2016.11.002zbMATH Open1390.13080OpenAlexW2963365858MaRDI QIDQ504409FDOQ504409

Authors John Abbott, Anna M. Bigatti, Lorenzo Robbiano 

Publication date 16 January 2017

Published in Journal of Symbolic Computation (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/1602.03993

zbMATH Keywords

hypersurfaceimplicitization

Mathematics Subject Classification ID

Symbolic computation and algebraic computation (68W30) Gröbner bases; other bases for ideals and modules (e.g., Janet and border bases) (13P10) Computational aspects of algebraic surfaces (14Q10)

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.

Recommendations

• scientific article; zbMATH DE number 2079841
• Implicitizing rational hypersurfaces using approximation complexes
• scientific article; zbMATH DE number 1263414
• Implicitization of parametric curves and surfaces by using multidimensional Newton formulae
• An implicitization algorithm with fewer variables

Cites work

• scientific article; zbMATH DE number 1515218 (Why is no real title available?)
• scientific article; zbMATH DE number 2206382 (Why is no real title available?)
• A simple method for implicitizing rational curves and surfaces
• Comparison of implicitization methods
• Computing ideals of points
• Computing zero-dimensional schemes
• Fault-tolerant modular reconstruction of rational numbers
• Hyperplane sections, Gröbner bases, and Hough transforms
• Implicitization of curves and surfaces using predicted support
• Implicitization of rational hypersurfaces via linear syzygies: a practical overview
• Implicitizing rational hypersurfaces using approximation complexes
• Introduction to the theory of weighted projective spaces
• Matrix-based implicit representations of rational algebraic curves and applications
• Minkowski decomposition and geometric predicates in sparse implicitization
• Moving curve ideals of rational plane parametrizations
• On Hensel factorization. I
• The use of bad primes in rational reconstruction

Cited in

(13)

• Computing and using minimal polynomials
• Implicitization and parametrization of nonsingular cubic surfaces
• Implicit representations of high-codimension varieties
• Implicitization of curves and (hyper)surfaces using predicted support
• Efficient Groebner walk conversion for implicitization of geometric objects
• Implicitization of de Jonquières parametrizations
• Ideals modulo a prime
• Implicitization of a general union of parametric varieties
• Implicitisation and parameterisation in polynomial functors
• Implicitizing rational hypersurfaces using approximation complexes
• Implicitization using approximation complexes
• A new class of term orders for elimination
• Title not available (Why is no real title available?)

Describes a project that uses

Uses Software

• CoCoA
• CoCoALib

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)