[HTML][HTML] Implicitization of hypersurfaces
We present new, practical algorithms for the hypersurface implicitization problem: namely,
given a parametric description (in terms of polynomials or rational functions) of the …
given a parametric description (in terms of polynomials or rational functions) of the …
Geometric operations using sparse interpolation matrices
IZ Emiris, T Kalinka, C Konaxis - Graphical Models, 2015 - Elsevier
Based on the computation of a superset of the implicit support, implicitization of a
parametrically given hypersurface is reduced to computing the nullspace of a numeric …
parametrically given hypersurface is reduced to computing the nullspace of a numeric …
[PDF][PDF] On the space of Minkowski summands of a convex polytope
On the space of Minkowski summands of a convex polytope Page 1 EuroCG 2016, Lugano,
Switzerland, March 30–April 1, 2016 On the space of Minkowski summands of a convex …
Switzerland, March 30–April 1, 2016 On the space of Minkowski summands of a convex …
Algebraic combinatorics and resultant methods for polynomial system solving
A Karasoulou - 2017 - inria.hal.science
The contribution of the thesis is threefold. The first Problem is computing the discriminant,
when the system's dimension varies. Thus solving polynomial equations and systems by …
when the system's dimension varies. Thus solving polynomial equations and systems by …
[PDF][PDF] A Hybrid Resultant Matrix Algorithm Based on the Sylvester-bezout Formulation
SN Ahmad - 2016 - academia.edu
The resultant of a system of polynomial equations is a factor of the determinant of the
resultant matrix. The matrix is said to be optimal when its determinant equals exactly the …
resultant matrix. The matrix is said to be optimal when its determinant equals exactly the …
[引用][C] Approximating Minkowski Decomposition and 2D Subset Sum
C Tzovas - 2016 - University OF Athens