Search results for: Ioannis Emiris
chapter
Lecture Notes in Computer Science > Applied Algebra, Algebraic Algorithms and Error-Correcting Codes > 89-104
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 subdivision to the Minkowski Sum of the input Newton polytopes. It constructs a matrix whose determinant is a non-zero multiple of the resultant so that the latter can be defined as the GCD of n + 1 such determinants...
chapter
Lecture Notes in Computer Science > Computational Science and Its Applications – ICCSA 2005 > Computational Geometry and Applications (CGA’5) Workshop > 683-696
Curve offsets are important objects in computer-aided design. We study the algebraic properties of the offset to an algebraic curve, thus obtaining a general formula for its degree. This is applied to computing the degree of the offset to conics. We also compute an implicit equation of the generalised offset to a conic by using sparse resultants and the knowledge of the degree of the implicit equation.
