| A CGAL-based Univariate Algebraic Kernel and Application to Arrangements (2009) | |||||||||||||||
Abstract | |||||||||||||||
| Solving univariate polynomials and multivariate polynomial systems is critical in geometric computing with curved objects. Moreover, the real roots need to be computed in a certified way in order to avoid possible inconsistency in geometric algorithms. We present a Cgal-based univariate algebraic kernel, which follows the Cgal specifications for univariate kernels. It provides certified real-root isolation of univariate polynomials with integer coefficients (based on the library Rs) and standard functionalities such as basic arithmetic operations, gcd and square-free factorization. We compare our implementation with that of other univariate algebraic kernels that follow the same Cgal specifications. In particular, we compare it to the one developed at MPII. We also apply this kernel to the computation of arrangements of univariate polynomial functions. 1 | |||||||||||||||
Publication details | |||||||||||||||
| |||||||||||||||