M. H. Austern, Generic Programming and the STL, 1998.

S. Basu, R. Pollack, and M. Roy, Algorithms in real algebraic geometry, 2003.
DOI : 10.1007/978-3-662-05355-3

URL : https://hal.archives-ouvertes.fr/hal-01083587

E. Berberich, A. Eigenwillig, M. Hemmer, S. Hert, K. Mehlhorn et al., A Computational Basis for Conic Arcs and Boolean Operations on Conic Polygons, Proc. 10th European Symposium on Algorithms, pp.174-186, 2002.
DOI : 10.1007/3-540-45749-6_19

C. Burnikel, S. Funke, K. Mehlhorn, S. Schirra, and S. Schmitt, A Separation Bound for Real Algebraic Expressions, Proc. 9th European Symposium on Algorithms, pp.254-265, 2001.
DOI : 10.1007/3-540-44676-1_21

O. Devillers, A. Fronville, B. Mourrain, and M. Teillaud, Algebraic methods and arithmetic filtering for exact predicates on circle arcs, Computational Geometry, vol.22, issue.1-3, pp.119-142, 2002.
DOI : 10.1016/S0925-7721(01)00050-5

URL : https://hal.archives-ouvertes.fr/hal-01179417

A. Eigenwillig, L. Kettner, E. Schömer, and N. Wolpert, Complete, exact, and efficient computations with cubic curves, Proceedings of the twentieth annual symposium on Computational geometry , SCG '04, 2004.
DOI : 10.1145/997817.997879

I. Z. Emiris and E. P. Tsigaridas, Methods to compare real roots of polynomials of small degree, 2003.

I. Z. Emiris and E. P. Tsigaridas, Comparison of fourth-degree algebraic numbers and applications to geometric predicates, 2003.

E. Fogel, D. Halperin, R. Wein, M. Teillaud, E. Berberich et al., Specification of the traits classes for cgal arrangements of curves, 2003.

G. Gatellier, B. Mourrain, and J. Pavone, Axel: Algebraic software component for geometric modeling, 2003.

N. Geismann, M. Hemmer, and E. Schömer, Computing a 3-dimensional cell in an arrangement of quadrics, Proceedings of the seventeenth annual symposium on Computational geometry , SCG '01, pp.264-273, 2001.
DOI : 10.1145/378583.378689

L. Guibas, M. Karavelas, and D. , A computation framework for handling motion, Proc. ALENEX, 2004.

S. Hert, M. Hoffmann, L. Kettner, S. Pion, and M. Seel, An Adaptable and Extensible Geometry Kernel, Proc. Workshop on Algorithm Engineering, pp.79-90, 2001.
DOI : 10.1007/3-540-44688-5_7

URL : https://hal.archives-ouvertes.fr/inria-00344964

M. I. Karavelas and I. Z. Emiris, Root comparison techniques applied to computing the additively weighted Voronoi diagram, Proc. 14th ACM-SIAM Sympos. Discrete Algorithms (SODA), pp.320-329, 2003.

C. Li and C. Yap, A new constructive root bound for algebraic expressions, 12th ACM- SIAM Symposium on Discrete Algorithms (SODA), 2001.

B. Mourrain, J. Técourt, and M. Teillaud, Predicates for the sweeping of an arrangement of quadrics in 3d, 2003.

S. Pion and M. Teillaud, Towards a cgal-like kernel for curves, 2003.

T. Sederberg and G. Chang, Isolating the real roots of polynomials using isolator polynomials Algebraic Geometry and Applications, Spec. Issue of Symp. on occasion of S. Abhyankar's 60th Birthday, 1993.

R. Wein, High-Level Filtering for Arrangements of Conic Arcs, Proc. 10th European Symposium on Algorithms, pp.884-895, 2002.
DOI : 10.1007/3-540-45749-6_76

R. Wein, Cgal based implementation of arrangements of conic arcs, 2003.

N. Wolpert, Jacobi Curves: Computing the Exact Topology of Arrangements of Non-singular Algebraic Curves, Proc. 11th European Symp. Algorithms, pp.532-543, 2003.
DOI : 10.1007/978-3-540-39658-1_49

C. Yap, Fundamental Problems of Algorithmic Algebra, 2000.