Implicitization of hypersurfaces
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.
- Numerical implicitization of parametric hypersurfaces with linear algebra
- 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
- A simple method for implicitizing rational curves and surfaces
- Comparison of implicitization methods
- Computational commutative algebra. I
- Computational commutative algebra. II
- 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
- Implicitization of parametric curves and surfaces by using multidimensional Newton formulae
- Implicit representations of high-codimension varieties
- Computing and using minimal polynomials
- Efficient Groebner walk conversion for implicitization of geometric objects
- A new class of term orders for elimination
- Implicitizing rational hypersurfaces using approximation complexes
- Implicitization using approximation complexes
- Implicitization of curves and (hyper)surfaces using predicted support
- Implicitization of de Jonquières parametrizations
- scientific article; zbMATH DE number 1263414 (Why is no real title available?)
- Numerical implicitization of parametric hypersurfaces with linear algebra
- Ideals modulo a prime
- Implicitization of a general union of parametric varieties
- Implicitization and parametrization of nonsingular cubic surfaces
- Implicitisation and parameterisation in polynomial functors
- On the computation of Newton polytopes of eliminants
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)