Implicitization of curves and (hyper)surfaces using predicted support

DOI10.1016/j.tcs.2012.10.018zbMath1297.68272OpenAlexW2049426318WikidataQ57908687 ScholiaQ57908687MaRDI QIDQ385002

Tatjana Kalinka, Christos Konaxis, Luu Ba Thang, Ioannis Z. Emiris

Publication date: 29 November 2013

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.tcs.2012.10.018

zbMATH Keywords

interpolationNewton polytopeimplicitizationsparse resultant

Mathematics Subject Classification ID

Symbolic computation and algebraic computation (68W30) Computational aspects of algebraic surfaces (14Q10) Computational aspects of algebraic curves (14Q05) Solving polynomial systems; resultants (13P15)

Related Items (5)

Adjusted least squares fitting of algebraic hypersurfaces ⋮ Faster geometric algorithms via dynamic determinant computation ⋮ Implicitization of curves and (hyper)surfaces using predicted support ⋮ The power of pyramid decomposition in Normaliz ⋮ Rational Hausdorff divisors: a new approach to the approximate parametrization of curves

Uses Software

• Maple
• Matlab
• Normaliz
• LattE
• TOPCOM
• respol
• TrIm

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Implicitization of curves and (hyper)surfaces using predicted support
• Normaliz: Algorithms for affine monoids and rational cones
• An implicitization challenge for binary factor analysis
• The Newton polygon of a rational plane curve
• Computing the Newton polygon of the implicit equation
• Approximate parametrization of plane algebraic curves by linear systems of curves
• Matrix-based implicit representations of rational algebraic curves and applications
• A characterization of A-discriminantal hypersurfaces in terms of logarithmic Gauss map
• Interpolating polynomials from their values
• Computing the Fréchet distance between simple polygons
• Computing the minimum distance between two Bézier curves
• The moving line ideal basis of planar rational curves
• On the Newton polytope of the resultant
• Simple multivariate polynomial multiplication
• Implicitization of parametric curves and surfaces by using multidimensional Newton formulae
• Symbolic and numeric methods for exploiting structure in constructing resultant matrices
• Implicitization of rational surfaces by means of polynomial interpolation
• Comparison of distance measures for planar curves
• Multi-point evaluation in higher dimensions
• Studying cyclides with Laguerre geometry
• On the complexity of sparse elimination
• Macaulay style formulas for sparse resultants
• Implicitization of curves and surfaces using predicted support
• An output-sensitive algorithm for computing projections of resultant polytopes
• Approximate Implicitization of Space Curves
• Tropical Implicitization and Mixed Fiber Polytopes
• Tropical discriminants
• Shape Interrogation for Computer Aided Design and Manufacturing
• Solving sparse linear equations over finite fields
• A Global Lojasiewicz Inequality for Algebraic Varieties
• Lagrange interpolation on subgrids of tensor product grids
• A subdivision-based algorithm for the sparse resultant

This page was built for publication: Implicitization of curves and (hyper)surfaces using predicted support