Implicitization of curves and (hyper)surfaces using predicted support
This paper introduces a method for finding the implicit form \(F(x_0, \ldots, x_n) = 0\) of hypersurfaces represented in parametric form. This process is also known as implicitization. The method works by splitting the problem into two parts, which are attacked separately. The first step applies sparse (or toric) elimination theory to predict a superset \(S\) of the support of the implicit form \(F\), i.e., the monomials that have nonzero coefficient in \(F\). In the second step one forms a matrix \(M\) by evaluating monomials in \(S\) at certain random sites, and obtains the coefficient vector of \(F\) as an element of the kernel of \(M\).NEWLINENEWLINEThe method can be used in the presence of base points as well, in which case the output polynomial contains the implicit form \(F\) as a factor, and works for both exact and approximate implicitization. Implementations in Maple and Matlab are provided to study the numerical stability and efficiency for several classes of curves and surfaces. It is found that ``unitary complex numbers offer the best tradeoff between speed and accuracy when numerical methods are employed, namely SVD, whereas for exact kernel computation random integers is the method of choice. A comparison to existing software shows that the method is rather competitive.
- Implicitization of curves and surfaces using predicted support
- scientific article; zbMATH DE number 17843
- Implicitization of hypersurfaces
- Implicit representation of parametric curves and surfaces
- scientific article; zbMATH DE number 947805
- Implicitization of rational parametric surfaces
- Implicit Curves and Surfaces: Mathematics, Data Structures and Algorithms
- A characterization of A-discriminantal hypersurfaces in terms of logarithmic Gauss map
- A Global Lojasiewicz Inequality for Algebraic Varieties
- A subdivision-based algorithm for the sparse resultant
- An implicitization challenge for binary factor analysis
- An output-sensitive algorithm for computing projections of resultant polytopes
- Approximate implicitization of space curves
- Approximate parametrization of plane algebraic curves by linear systems of curves
- Comparison of distance measures for planar curves
- Computing the Fréchet distance between simple polygons
- Computing the minimum distance between two Bézier curves
- Computing the Newton polygon of the implicit equation
- scientific article; zbMATH DE number 5707897 (Why is no real title available?)
- scientific article; zbMATH DE number 1206418 (Why is no real title available?)
- scientific article; zbMATH DE number 481965 (Why is no real title available?)
- scientific article; zbMATH DE number 575960 (Why is no real title available?)
- scientific article; zbMATH DE number 671748 (Why is no real title available?)
- scientific article; zbMATH DE number 2034392 (Why is no real title available?)
- scientific article; zbMATH DE number 2051424 (Why is no real title available?)
- scientific article; zbMATH DE number 2079841 (Why is no real title available?)
- scientific article; zbMATH DE number 1860735 (Why is no real title available?)
- scientific article; zbMATH DE number 1405493 (Why is no real title available?)
- Implicitization of curves and (hyper)surfaces using predicted support
- Implicitization of curves and surfaces using predicted support
- Implicitization of parametric curves and surfaces by using multidimensional Newton formulae
- Implicitization of rational surfaces by means of polynomial interpolation
- Interpolating polynomials from their values
- Lagrange interpolation on subgrids of tensor product grids
- Macaulay style formulas for sparse resultants
- Matrix-based implicit representations of rational algebraic curves and applications
- Multi-point evaluation in higher dimensions
- Normaliz: Algorithms for affine monoids and rational cones
- On Horn-Kapranov uniformisation of the discriminantal loci
- On the complexity of sparse elimination
- On the Newton polytope of the resultant
- Piecewise approximate implicitization: experiments using industrial data
- Shape Interrogation for Computer Aided Design and Manufacturing
- Simple multivariate polynomial multiplication
- Solving sparse linear equations over finite fields
- Studying cyclides with Laguerre geometry
- Symbolic and numeric methods for exploiting structure in constructing resultant matrices
- The moving line ideal basis of planar rational curves
- The Newton polygon of a rational plane curve
- The Newton polytope of the implicit equation
- Tropical discriminants
- Tropical Implicitization and Mixed Fiber Polytopes
- Implicit representations of high-codimension varieties
- Rational Hausdorff divisors: a new approach to the approximate parametrization of curves
- Numerical stability of surface implicitization
- Implicitization of curves and surfaces using predicted support
- Minkowski decomposition and geometric predicates in sparse implicitization
- Adjusted least squares fitting of algebraic hypersurfaces
- Faster geometric algorithms via dynamic determinant computation
- Sparse implicitization via interpolation
- Implicitization of curves and (hyper)surfaces using predicted support
- scientific article; zbMATH DE number 2034392 (Why is no real title available?)
- Comparison of implicitization methods
- Mixed subdivisions suitable for the greedy Canny-Emiris formula
- The power of pyramid decomposition in Normaliz
This page was built for publication: Implicitization of curves and (hyper)surfaces using predicted support
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q385002)
