Computing the Newton Polygon of the Implicit Equation |
| |
Authors: | Ioannis Z. Emiris Christos Konaxis Leonidas Palios |
| |
Affiliation: | 1.Department of Informatics and Telecommunications,National Kapodistrian University of Athens,Athens,Greece;2.Department of Computer Science,University of Ioannina,Ioannina,Greece |
| |
Abstract: | We consider rationally parameterized plane curves, where the polynomials in the parameterization have fixed supports and generic coefficients. We apply sparse (or toric) elimination theory in order to determine the vertex representation of the implicit equation’s Newton polygon. In particular, we consider mixed subdivisions of the input Newton polygons and regular triangulations of point sets defined by Cayley’s trick. We consider polynomial and rational parameterizations, where the latter may have the same or different denominators; the implicit polygon is shown to have, respectively, up to four, five, or six vertices. |
| |
Keywords: | |
本文献已被 SpringerLink 等数据库收录! |
|