Multihomogeneous resultant matrices for systems with scaled support (2009)
Emiris, Ioannis, Mantzaflaris, Angelos
Constructive methods for matrices of multihomogeneous resultants for unmixed systems have been studied in [DE03,SZ94,WZ94]. We generalize these constructions to mixed systems, whose Newton polytopes...
Multihomogeneous resultant matrices for systems with scaled support (2009)
Emiris, Ioannis, Mantzaflaris, Angelos
Constructive methods for matrices of multihomogeneous resultants for unmixed systems have been studied in [DE03,SZ94,WZ94]. We generalize these constructions to mixed systems, whose Newton polytopes...
3. The Curved Kernel 4. The Algebraic Kernel 5. The Arrangement Traits Outline (2008)
Elias Tsigaridas, Ioannis Emiris, Monique Teillaud, Sylvain Pion, Arrangement Of Lines
ACS Algorithms for Complex Shapes with Certified Numerics and Topology (2008)
Ioannis Emiris, Elias Tsigaridas, George Tzoumas
Algebraic tools for the Voronoi diagram of ellipses, leading to an experimental implementation
David A. Cox, Alicia Dickenstein, Lorenzo Robbiano (univ, Ioannis Emiris
Genova) Eigenvalue and eigenvector methods for solving polynomial equations Introduction to residues and resultants Polynomial systems and some applications to statistics
Matrix-based methods for solving polynomial systems (2007)
Ioannis Emiris, Projet Safir, Inria Sophia-antipolis
[summary by Fr'ed'eric Chyzak] We present a uniform approach to the elimination of variables between polynomials and the construction of matrices that express resultants. Building a matrix...
Force Closure Grasps of High Quality (2007)
We study grasps of multifinger dexterous hands under the point contact model. Specifically, we are interested in high-quality force closure grasps. We abstract the problem into the space of...
Force Closure Grasps of High Quality (2007)
We study grasps of multifinger dexterous hands under the point contact model. Specifically, we are interested in high-quality force closure grasps. We abstract the problem into the space of...
A note on the complexity of univariate root isolation (2006)
Emiris, Ioannis, Tsigaridas, Elias
This paper presents the average-case bit complexity of subdivision-based univariate solvers, namely those named after Sturm, Descartes, and Bernstein. By real solving we mean real root isolation. We...
A note on the complexity of univariate root isolation (2006)
Emiris, Ioannis, Tsigaridas, Elias
This paper presents the average-case bit complexity of subdivision-based univariate solvers, namely those named after Sturm, Descartes, and Bernstein. By real solving we mean real root isolation. We...
On the complexity of real root isolation using Continued Fractions (2006)
Tsigaridas, Elias, Emiris, Ioannis
We present algorithmic, complexity and implementation results concerning real root isolation of integer univariate polynomials using the continued fraction expansion of real algebraic numbers. One...
On the complexity of real root isolation using Continued Fractions (2006)
Tsigaridas, Elias, Emiris, Ioannis
We present algorithmic, complexity and implementation results concerning real root isolation of integer univariate polynomials using the continued fraction expansion of real algebraic numbers. One...
Ioannis Emiris, Menelaos Karavelas, Leonidas Palios
Compilation copyright c ○ 2006 by Menelaos Karavelas. Copyrights of individual papers retained by the authors. Workshop logo by Menelaos Karavelas. Printed in Greece.
An empirical comparison of software for constructing arrangements of curved arcs (2004)
Berberich,Eric, Eigenwillig,Arno, Emiris,Ioannis, Fogel,Efraim, Hemmer,Michael, Halperin,Dan, ...
An empirical comparison of software for constructing arrangements of curved arcs (2004)
Berberich, Eric, Eigenwillig, Arno, Emiris, Ioannis, Fogel, Efraim, Hemmer, Michael, Halperin, Dan, ...
Towards an Open Curved Kernel (2004)
Emiris, Ioannis, Kakargias, Athanasios, Pion, Sylvain, Teillaud, Monique, Tsigaridas, Elias
Our work goes towards answering the growing need for the robust and efficient manipulation of curved objects in numerous applications. The kernel of the CGAL library provides several functionalities...
Towards an Open Curved Kernel (2004)
Emiris, Ioannis, Kakargias, Athanasios, Pion, Sylvain, Teillaud, Monique, Tsigaridas, Elias
Our work goes towards answering the growing need for the robust and efficient manipulation of curved objects in numerous applications. The kernel of the CGAL library provides several functionalities...
1 Minkowski decomposition 1.1 The setting IOI’04: Solution of Polygon (2004)
Ioannis Emiris, Elias Tsigaridas
Although computing the Minkowski sum is straightforward ([2]), deciding whether a polygon is the Minkowski sum of 2 polygons is NP-complete. There is a pseudo-polynomial time algorithm for the latter...
An inversion-based implicitization method (2002)
Emiris, Ioannis, Sendra, J. rafael
This paper proposes a new method for implicitizing surfaces given by a proper parametrization mapping, under the assumption that the inverse mapping has been computed. The advantage of the method is...
An inversion-based implicitization method (2002)
Emiris, Ioannis, Sendra, J. rafael
This paper proposes a new method for implicitizing surfaces given by a proper parametrization mapping, under the assumption that the inverse mapping has been computed. The advantage of the method is...
An inversion-based implicitization method (2002)
Emiris, Ioannis, Sendra, J. rafael
This paper proposes a new method for implicitizing surfaces given by a proper parametrization mapping, under the assumption that the inverse mapping has been computed. The advantage of the method is...
An Empirical Comparison of Software for Constructing Arrangements of Curved Arcs (2000)
Sylvain Pion, Monique Teillaud, Efraim Fogel, Dan Halperin, Ron Wein, Ioannis Emiris, ...
Arrangements of planar curves are fundamental structures in computational geometry.
Sign Determination in Residue Number Systems (1999)
Brönnimann, Hervé, Emiris, Ioannis, Pan, Victor, Pion, Sylvain
Sign determination is a fundamental problem in algebraic as well as geometric computing. It is the critical operation when using real algebraic numbers and exact geometric predicates. We...
Sign Determination in Residue Number Systems (1999)
Brönnimann, Hervé, Emiris, Ioannis, Pan, Victor, Pion, Sylvain
Sign determination is a fundamental problem in algebraic as well as geometric computing. It is the critical operation when using real algebraic numbers and exact geometric predicates. We...
Computing exact geometric predicates using modular arithmetic with single precision (1997)
Brönnimann, Hervé, Emiris, Ioannis, Pan, Victor, Pion, Sylvain
We propose an efficient method that determines the sign of a multivariate polynomial expression with integer coefficients. This is a central operation on which the robustness of many geometric...
Computing exact geometric predicates using modular arithmetic with single precision (1997)
Brönnimann, Hervé, Emiris, Ioannis, Pan, Victor, Pion, Sylvain
We propose an efficient method that determines the sign of a multivariate polynomial expression with integer coefficients. This is a central operation on which the robustness of many geometric...
An efficient algorithm for the sparse mixed resultant (1993)
We propose a compact formula for the mixed resultant ofa system of n+1 sparse Laurent polynomials in n variables. Our approach is conceptually simple and geometric, in that it applies a mixed...
An Efficient Algorithm for the Sparse Mixed Resultant (1993)
. We propose a compact formula for the mixed resultant of a system of n+1 sparse Laurent polynomials in n variables. Our approach is conceptually simple and geometric, in that it applies a mixed...
An Efficient Approach to Removing Geometric Degeneracies (Extended Abstract) (1992)
) Ioannis Emiris John Canny emiris@cs.berkeley.edu jfc@cs.berkeley.edu Computer Science Division University of California, Berkeley Abstract Our aim is to perturb the input so that an algorithm...