C. Boost and . Libraries,

. Cgal, Computational Geometry Algorithms Library

K. Pankaj, M. Agarwal, and . Sharir, Arrangements and their applications, Handbook of Computational Geometry, pp.49-119, 2000.

P. Anderson and G. Anderson, Navigating C++ and Object-Oriented Design, 2003.

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

H. Brönnimann, C. Burnikel, and S. Pion, Interval arithmetic yields efficient dynamic filters for computational geometry, Discrete Applied Mathematics, vol.109, pp.25-47, 2001.

G. E. Collins, A method for overlapping and erasure of lists, Communications of the ACM, vol.3, issue.12, pp.655-657, 1960.

O. Devillers, A. Fronville, B. Mourrain, and M. Teillaud, Algebraic methods and arithmetic filtering for exact predicates on circle arcs, Comput. Geom. Theory Appl, vol.22, pp.119-142, 2002.
URL : https://hal.archives-ouvertes.fr/inria-00072832

I. Emiris and E. P. Tsigaridas, Computing with real algebraic numbers of small degree, Proc. 12th European Symposium on Algorithms, vol.3221, pp.652-663, 2004.

Z. Ioannis, A. Emiris, . Kakargias, M. Sylvain-pion, E. P. Teillaud et al., Towards an open curved kernel, Proc. 20th Annu. ACM Sympos, pp.438-446, 2004.

E. Fogel, D. Halperin, and L. Kettner, Monique Teillaud, Ron Wein, and Nicola Wolpert. Arrangements, Effective Computational Geometry for Curves and Surfaces, 2006.

E. Fogel and M. Teillaud, Generic programming and the CGAL library, Effective Computational Geometry for Curves and Surfaces, 2006.
URL : https://hal.archives-ouvertes.fr/hal-01053388

E. Fogel, R. Wein, B. Zukerman, and D. Halperin, 2D regularized boolean set-operations, 2006.

S. Funke and K. Mehlhorn, Look: A lazy objectoriented kernel for geometric computation, Proc. 16th

, Annu. ACM Sympos. Comput. Geom, pp.156-165, 2000.

D. Halperin and . Arrangements, Handbook of Discrete and Computational Geometry, chapter 21, pp.389-412, 1997.

S. Hert, M. Hoffmann, and L. Kettner, Sylvain Pion, and Michael Seel. An adaptable and extensible geometry kernel, Computational Geometry: Theory and Applications

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

J. Keyser, T. Culver, M. Foskey, S. Krishnan, and D. Manocha, ESOLID -a system for exact boundary evaluation, Computer-Aided Design, vol.26, issue.2, pp.175-193, 2004.

N. C. Myers, Traits: a new and useful template technique, 1995.

S. Pion and M. Teillaud, 2D circular kernel, 2006.

R. Wein and E. Fogel, Baruch Zukerman, and Dan Halperin. 2D arrangements, 2006.

R. Wein, E. Fogel, B. Zukerman, and D. Halperin, Advanced programming techniques applied to CGAL's arrangement package. Computational Geometry: Theory and Applications, To appear, Special issue on CGAL

C. K. Yap and T. Dubé, The exact computation paradigm, Computing in Euclidean Geometry, vol.4, pp.452-492, 1995.