3 citations · 4 across the 5 of their papers we have counts for
7 papers
A sparse overview on sparse resultants
Carles Checa, Ioannis Z. Emiris, Christos Konaxis
In this survey, we give an overview of advances in the theory and computation of sparse resultants. First, we examine the construction and proof of the Canny-Emiris formula, which…
Matrix representations by means of interpolation
Ioannis Z. Emiris, Christos Konaxis, Ilias S. Kotsireas +1
We examine implicit representations of parametric or point cloud models, based on interpolation matrices, which are not sensitive to base points. We show how interpolation matrices…
Sparse implicitization by interpolation: Geometric computations using matrix representations
Ioannis Emiris, Tatjana Kalinka, Christos Konaxis
Based on the computation of a superset of the implicit support, implicitization of a parametrically given hyper-surface is reduced to computing the nullspace of a numeric matrix. O…
The maximum number of faces of the Minkowski sum of three convex polytopes
Menelaos I. Karavelas, Christos Konaxis, Eleni Tzanaki
We derive tight expressions for the maximum number of -faces, , of the Minkowski sum, , of three -dimensional convex polytopes , and $P…
An Oracle-based, Output-sensitive Algorithm for Projections of Resultant Polytopes
Ioannis Z. Emiris, Vissarion Fisikopoulos, Christos Konaxis +1
We design an algorithm to compute the Newton polytope of the resultant, known as resultant polytope, or its orthogonal projection along a given direction. The resultant is fundamen…
The maximum number of faces of the Minkowski sum of two convex polytopes
Menelaos I. Karavelas, Eleni Tzanaki
We derive tight expressions for the maximum number of -faces, , of the Minkowski sum, , of two -dimensional convex polytopes and ,…