A CGAL-based Univariate Algebraic Kernel and Application to Arrangements

Solving univariate polynomials and operations with real algebraic numbers are 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, as well as comparison and sign evaluations of real algebraic numbers. We compare our implementation with the univariate algebraic kernel developed at MPII, that also follows CGAL~specifications, on various data sets, using polynomials of degree up to 2 000 and maximum coefficient bit-size up to 25 000. Finally we apply our kernel to the computation of arrangements of univariate polynomial functions, and we present a bit complexity analysis of the algorithm for computing the arrangement of planar curves defined by univariate polynomials.

[1]  P. Zimmermann,et al.  Efficient isolation of polynomial's real roots , 2004 .

[2]  Pierre Alliez,et al.  Computational geometry algorithms library , 2008, SIGGRAPH '08.

[3]  Chee-Keng Yap,et al.  Almost tight recursion tree bounds for the Descartes method , 2006, ISSAC '06.

[4]  Monique Teillaud,et al.  Revision of interface specification of algebraic kernel , 2007 .

[5]  George E. Collins,et al.  Interval Arithmetic in Cylindrical Algebraic Decomposition , 2002, J. Symb. Comput..

[6]  Kurt Mehlhorn,et al.  Effective Computational Geometry for Curves and Surfaces , 2005 .

[7]  Bernard Mourrain,et al.  SYNAPS: A Library for Dedicated Applications in Symbolic Numeric Computing , 2008 .

[8]  Dinesh Manocha,et al.  MAPC: a library for efficient and exact manipulation of algebraic points and curves , 1999, SCG '99.

[9]  Bernard Mourrain,et al.  Real Algebraic Numbers: Complexity Analysis and Experimentation , 2008, Reliable Implementation of Real Number Algorithms.

[10]  Ron Wein,et al.  High-Level Filtering for Arrangements of Conic Arcs , 2002, ESA.

[11]  Sylvain Pion,et al.  Towards and open curved kernel , 2004, SCG '04.

[12]  J. Boissonnat,et al.  Effective Computational Geometry for Curves and Surfaces (Mathematics and Visualization) , 2006 .

[13]  Keith O. Geddes,et al.  Algorithms for computer algebra , 1992 .

[14]  Mark de Berg,et al.  Computational geometry: algorithms and applications , 1997 .

[15]  Chee-Keng Yap,et al.  A core library for robust numeric and geometric computation , 1999, SCG '99.

[16]  Editors , 1986, Brain Research Bulletin.

[17]  Ioannis Z. Emiris,et al.  On the complexity of real solving bivariate systems , 2007, ISSAC '07.

[18]  Alan Edelman,et al.  How many zeros of a random polynomial are real , 1995 .

[19]  Dinesh Manocha,et al.  ESOLID---A System for Exact Boundary Evaluation , 2002, SMA '02.

[20]  Kurt Mehlhorn,et al.  A Descartes Algorithm for Polynomials with Bit-Stream Coefficients , 2005, CASC.