An implicitization algorithm with fewer variables
From MaRDI portal
Recommendations
- Approximate implicitization
- Approximate implicitization using linear algebra
- Implicitization using approximation complexes
- Implicitization using univariate resultants
- An algorithm for implicit interpolation
- Towards generalization and optimization of implicit methods
- Comparison of implicitization methods
- An approach to weak approximate implicitization
- scientific article; zbMATH DE number 6154260
- scientific article; zbMATH DE number 1347291
Cites work
- scientific article; zbMATH DE number 4157916 (Why is no real title available?)
- scientific article; zbMATH DE number 17843 (Why is no real title available?)
- scientific article; zbMATH DE number 108068 (Why is no real title available?)
- Implicit representation of parametric curves and surfaces
- Implicit representation of rational parametric surfaces
Cited in
(15)- Implicitization of a general union of parametric varieties
- Implicitization of rational surfaces using toric varieties
- Efficient Groebner walk conversion for implicitization of geometric objects
- Implicitisation and parameterisation in polynomial functors
- The implicit equation of a multigraded hypersurface
- Implicitization of rational surfaces by means of polynomial interpolation
- Implicitization of hypersurfaces
- Gröbner bases applied to finitely generated field extensions
- Reduced Implicate Tries with Updates
- Implicitization of parametric curves via Lagrange interpolation
- Polynomial parametrization of curves without affine singularities
- Implicit representations of high-codimension varieties
- A direct approach to computing the \(\mu\)-basis of planar rational curves
- Computing the canonical representation of constructible sets
- Numerical stability of surface implicitization
This page was built for publication: An implicitization algorithm with fewer variables
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q673482)