Univariate Algebraic Kernel and Application to Arrangements - Inria - Institut national de recherche en sciences et technologies du numérique Accéder directement au contenu
Communication Dans Un Congrès Année : 2009

Univariate Algebraic Kernel and Application to Arrangements

Résumé

We present a cgal-based univariate algebraic kernel, which provides certied real-root isolation of univariate polynomials with integer coecients and standard functionalities such as basic arithmetic operations, greatest common divisor (gcd) and square-free factorization, as well as comparison and sign evaluations of real algebraic numbers. We compare our kernel with other comparable kernels, demonstrating the eciency of our approach. Our experiments are performed on large data sets including polynomials of high degree (up to 2 000) and with very large coecients (up to 25 000 bits per coecient). We also address the problem of computing arrangements of x-monotone polynomial curves. We apply our kernel to this problem and demonstrate its eciency compared to previous solutions available in cgal.
Fichier principal
Vignette du fichier
sea09_final.pdf (351.68 Ko) Télécharger le fichier
Origine : Fichiers produits par l'(les) auteur(s)
Loading...

Dates et versions

inria-00431559 , version 1 (12-11-2009)

Identifiants

Citer

Sylvain Lazard, Luis Mariano Peñaranda, Elias P. P. Tsigaridas. Univariate Algebraic Kernel and Application to Arrangements. 8th International Symposium SEA 2009, Jun 2009, Dortmund, Germany. pp.209-220, ⟨10.1007/978-3-642-02011-7⟩. ⟨inria-00431559⟩
297 Consultations
140 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More