]. F. Avnaim, J. Boissonnat, O. Devillers, F. Preparata, and M. Yvinec, Evaluating signs of determinants using single-precision arithmetic, Algorithmica, vol.37, issue.6, pp.111-132, 1997.
DOI : 10.1007/BF02522822
URL : https://hal.archives-ouvertes.fr/inria-00074367

J. Blömer, Computing sums of radicals in polynomial time, [1991] Proceedings 32nd Annual Symposium of Foundations of Computer Science, pp.670-677, 1991.
DOI : 10.1109/SFCS.1991.185434

H. Brnnimann, I. Emiris, V. Pan, and S. Pion, Sign detection in residue number systems, Theoret. Comput. Science, vol.210, pp.1-173, 1999.

H. Brnnimann and M. Yvinec, Efficient exact evaluation of signs of determinants, Proc. 13th Annu. ACM Sympos, pp.166-173, 1997.

C. Burnikel, S. Funke, and M. Seel, Exact geometric predicates using cascaded computation, Proceedings of the fourteenth annual symposium on Computational geometry , SCG '98, pp.175-183, 1998.
DOI : 10.1145/276884.276904
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.46.851

C. Burnikel, Exact Computation of Voronoi Diagrams and Line Segment Intersections, 1996.

K. L. Clarkson, Safe and effective determinant evaluation, Proceedings., 33rd Annual Symposium on Foundations of Computer Science, pp.387-395, 1992.
DOI : 10.1109/SFCS.1992.267751
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.88.5814

O. Devillers and F. P. Preparata, A Probabilistic Analysis of the Power of Arithmetic Filters, Discrete & Computational Geometry, vol.20, issue.4, 1996.
DOI : 10.1007/PL00009400
URL : https://hal.archives-ouvertes.fr/inria-00073727

A. Edalat and A. Lieutier, Foundation of a computable solid modeling, Proceedings of the fifth ACM symposium on Solid modeling and applications , SMA '99, 1999.
DOI : 10.1145/304012.304040

S. Fortune, A sweepline algorithm for Voronoi diagrams, Algorithmica, vol.14, issue.1-4, pp.153-174, 1987.
DOI : 10.1007/BF01840357

S. Fortune, Voronoi diagrams and Delaunay triangulations, Computing in Euclidean Geometry, pp.225-265, 1992.

S. Fortune and C. J. Van-wyk, Efficient exact arithmetic for computational geometry, Proceedings of the ninth annual symposium on Computational geometry , SCG '93, pp.163-172, 1993.
DOI : 10.1145/160985.161015

S. Fortune and C. J. Van-wyk, Static analysis yields efficient exact integer arithmetic for computational geometry, ACM Transactions on Graphics, vol.15, issue.3, pp.3-223, 1996.
DOI : 10.1145/231731.231735

K. Mehlhorn and S. Näher, The implementation of geometric algorithms, Proc. 13th World Computer Congress IFIP94, pp.223-231, 1994.

R. E. Moore, Interval Analysis, 1966.

A. Neumaier, Interval Methods for Systems of Equations, 1990.
DOI : 10.1017/CBO9780511526473

J. R. Shewchuk, Adaptive Precision Floating-Point Arithmetic and Fast Robust Geometric Predicates, Discrete & Computational Geometry, vol.18, issue.3, pp.305-363, 1997.
DOI : 10.1007/PL00009321

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

C. K. Yap, Robust geometric computations, Handbook of Discrete and Computational Geometry, pp.653-668, 1997.