P. Agarwal, L. Guibas, A. Nguyen, D. , and L. Zhang, Collision detection for deforming necklaces, Computational Geometry, vol.28, issue.2-3, pp.137-163, 2004.
DOI : 10.1016/j.comgeo.2004.03.008

O. Aichholzer, F. Aurenhammer, T. Hackl, B. Jüttler, M. Oberneder et al., COMPUTATIONAL AND STRUCTURAL ADVANTAGES OF CIRCULAR BOUNDARY REPRESENTATION, Proc. 10th International Workshop on Algorithms and Data Structures, pp.374-385, 2007.
DOI : 10.1142/S0218195911003548

N. Amenta, S. Choi, and R. Kolluri, The power crust, unions of balls, and the medial axis transform, Computational Geometry, vol.19, issue.2-3, pp.127-153, 2001.
DOI : 10.1016/S0925-7721(01)00017-7

M. V. Andrade and J. Stolfi, EXACT ALGORITHMS FOR CIRCLES ON THE SPHERE, International Journal of Computational Geometry & Applications, vol.11, issue.03, pp.267-290, 2001.
DOI : 10.1142/S021819590100050X

D. Avis, B. K. Bhattacharya, and H. Imai, Computing the volume of the union of spheres. The Visual Computer, pp.323-328, 1988.

J. Bentley and T. Ottmann, Algorithms for Reporting and Counting Geometric Intersections, IEEE Transactions on Computers, vol.28, issue.9, pp.643-647, 1979.
DOI : 10.1109/TC.1979.1675432

E. Berberich, E. Fogel, D. Halperin, K. Mehlhorn, and R. Wein, Sweeping and Maintaining Two-Dimensional Arrangements on Surfaces: A First Step, Proc. 15th European Symposium on Algorithms, pp.645-656, 2007.
DOI : 10.1007/978-3-540-75520-3_57

E. Berberich, M. Hemmer, L. Kettner, E. Schömer, and N. Wolpert, An exact, complete and efficient implementation for computing planar maps of quadric intersection curves, Proceedings of the twenty-first annual symposium on Computational geometry , SCG '05, pp.99-106, 2005.
DOI : 10.1145/1064092.1064110

K. Q. Brown, Comments on " Algorithms for reporting and counting geometric intersections, IEEE Transactions on Computers, vol.30, issue.2, pp.147-148, 1981.

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

P. M. De-castro, F. Cazals, S. Loriot, and M. Teillaud, Design of the CGAL 3D Spherical Kernel and application to arrangements of circles on a sphere, Computational Geometry, vol.42, issue.6-7, 2007.
DOI : 10.1016/j.comgeo.2008.10.003

P. M. De-castro, S. Pion, and M. Teillaud, Exact and efficient computations on circles in CGAL, Abstracts 23rd European Workshop on Computational Geometry, pp.219-222
URL : https://hal.archives-ouvertes.fr/inria-00123259

P. M. De-castro and M. Teillaud, 3D spherical kernel, CGAL User and Reference Manual. 3.4 edition, 2008.

F. Cazals and S. Loriot, Computing the exact arrangement of circles on a sphere, with applications in structural biology, Proceedings of the twenty-third annual symposium on Computational geometry , SCG '07, 2006.
DOI : 10.1145/1247069.1247088
URL : https://hal.archives-ouvertes.fr/inria-00118781

. Cgal, Computational Geometry Algorithms Library

F. Chazal, D. Cohen-steiner, and Q. Mérigot, Stability of boundary measure, Research Report, vol.6219, 2007.

M. L. Connolly, Molecular surfaces: a review, Network Science, vol.14, 1996.

R. S. Drysdale, G. Rote, and A. Sturm, Approximation of an open polygonal curve with a minimum number of circular arcs and biarcs, Computational Geometry, vol.41, issue.1-2, pp.31-47, 2008.
DOI : 10.1016/j.comgeo.2007.10.009

I. Z. Emiris, A. Kakargias, S. Pion, M. Teillaud, and E. P. Tsigaridas, Towards and open curved kernel, Proceedings of the twentieth annual symposium on Computational geometry , SCG '04, pp.438-446, 2004.
DOI : 10.1145/997817.997882

. Exacus, Efficient and Exact Algorithms for Curves and Surfaces

E. Eyal and D. Halperin, Dynamic maintenance of molecular surfaces under conformational changes, Proceedings of the twenty-first annual symposium on Computational geometry , SCG '05, pp.45-54, 2005.
DOI : 10.1145/1064092.1064102

A. Fabri and S. Pion, A generic lazy evaluation scheme for exact geometric computations, Proc. 2nd Library-Centric Software Design, pp.75-84, 2006.
URL : https://hal.archives-ouvertes.fr/inria-00089229

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

S. Funke and K. Mehlhorn, Look --- a Lazy Object-Oriented Kernel for geometric computation, Proceedings of the sixteenth annual symposium on Computational geometry , SCG '00, pp.156-165, 2000.
DOI : 10.1145/336154.336196

G. and G. Multiple, Precision Arithmetic Library

S. Hert, M. Hoffmann, L. Kettner, S. Pion, and M. Seel, An adaptable and extensible geometry kernel, Computational Geometry, vol.38, issue.1-2, pp.16-36, 2007.
DOI : 10.1016/j.comgeo.2006.11.004
URL : https://hal.archives-ouvertes.fr/inria-00344964

L. Kettner, K. Mehlhorn, S. Pion, S. Schirra, and C. K. Yap, Classroom examples of robustness problems in geometric computations, Computational Geometry, vol.40, issue.1, pp.61-78, 2008.
DOI : 10.1016/j.comgeo.2007.06.003
URL : https://hal.archives-ouvertes.fr/inria-00344515

J. Keyser, T. Culver, D. Manocha, and S. Krishnan, MAPC, Proceedings of the fifteenth annual symposium on Computational geometry , SCG '99, pp.360-369, 1999.
DOI : 10.1145/304893.304990

C. Li, S. Pion, and C. K. Yap, Recent progress in exact geometric computation, The Journal of Logic and Algebraic Programming, vol.64, issue.1, pp.85-111, 2005.
DOI : 10.1016/j.jlap.2004.07.006
URL : https://hal.archives-ouvertes.fr/inria-00344355

C. Li and C. K. Yap, A new constructive root bound for algebraic expressions, Proc. 12th Symposium on Discrete Algorithms, pp.496-505, 2001.

B. J. Mcconkey, V. Sobolev, and M. Edelman, Quantification of protein surfaces, volumes and atom-atom contacts using a constrained Voronoi procedure, Bioinformatics, vol.18, issue.10, pp.1365-1373, 2002.
DOI : 10.1093/bioinformatics/18.10.1365

B. Mourrain, J. Técourt, and M. Teillaud, On the computation of an arrangement of quadrics in 3D, Special issue, 19th European Workshop on Computational Geometry, pp.145-164, 2005.
DOI : 10.1016/j.comgeo.2004.05.003
URL : https://hal.archives-ouvertes.fr/inria-00350858

S. Pion and M. Teillaud, 2D circular kernel CGAL User and Reference Manual. 3.2 and 3.3 edition, p.2, 2006.

S. Rusinkiewicz and M. Levoy, QSplat, Proceedings of the 27th annual conference on Computer graphics and interactive techniques , SIGGRAPH '00, pp.343-352, 2000.
DOI : 10.1145/344779.344940

R. Wein, E. Fogel, B. Zukerman, and D. Halperin, 2D arrangements, CGAL User and Reference Manual. 3.2 and 3.3 edition, p.2, 2006.

C. K. Yap and T. Dubé, THE EXACT COMPUTATION PARADIGM, Computing in Euclidean Geometry, pp.452-492, 1995.
DOI : 10.1142/9789812831699_0011