A. A. Andrew, Another efficient algorithm for convex hulls in two dimensions, Information Processing Letters, vol.9, issue.5, pp.216-219, 1979.
DOI : 10.1016/0020-0190(79)90072-3

C. K. Clarkson and P. W. Shor, Applications of random sampling in computational geometry, II, Discrete & Computational Geometry, vol.1, issue.5, pp.387-421, 1989.
DOI : 10.1007/BF02187740

D. T. Dey, K. Sugihara, and C. L. Bajaj, Delaunay triangulations in three dimensions with finite precision arithmetic, Computer Aided Geometric Design, vol.9, issue.6, pp.457-470, 1992.
DOI : 10.1016/0167-8396(92)90044-P

S. Fortune and V. J. Milenkovic, Numerical stability of algorithms for line arrangements, Proceedings of the seventh annual symposium on Computational geometry , SCG '91, pp.334-341, 1991.
DOI : 10.1145/109648.109685

. A. For85 and . Forrest, Computational geometry in practice Fundamental Algorithms for Computer Graphics, volume F17 of NATO ASI, pp.707-724, 1985.

G. D. Goldberg, What every computer scientist should know about floating-point arithmetic, ACM Computing Surveys, vol.23, issue.1, pp.5-48, 1990.
DOI : 10.1145/103162.103163
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.1.7712

G. R. Graham, An efficient algorith for determining the convex hull of a finite planar set, Information Processing Letters, vol.1, issue.4, pp.132-133, 1972.
DOI : 10.1016/0020-0190(72)90045-2

H. D. Halperin and C. R. Shelton, A perturbation scheme for spherical arrangements with application to molecular modeling, Comp. Geom.: Theory and Applications, vol.10, 1998.

M. Karasick, D. Lieber, and L. R. Nackman, Efficient Delaunay triangulation using rational arithmetic, ACM Transactions on Graphics, vol.10, issue.1, pp.71-91, 1991.
DOI : 10.1145/99902.99905
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.475.2747

L. Z. Li and V. J. Milenkovic, Constructing strongly convex hulls using exact or rounded arithmetic, SoCG'90, pp.235-243, 1990.
DOI : 10.1007/bf01758851
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.48.6674

M. V. Milenkovic, Calculating approximate curve arrangements using rounded arithmetic, Proceedings of the fifth annual symposium on Computational geometry , SCG '89, pp.197-207, 1989.
DOI : 10.1145/73833.73856
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.52.1864

M. K. Mehlhorn and S. Näher, The LEDA Platform for Combinatorial and Geometric Computing, 1018.

. J. She97 and . Shewchuk, Adaptive precision floating-point arithmetic and fast robust geometric predicates, Discrete & Computational Geometry, vol.18, pp.305-363, 1997.

S. K. Sugihara, M. Iri, H. Inagaki, and T. Imai, Topology-Oriented Implementation--An Approach to Robust Geometric Algorithms, Algorithmica, vol.27, issue.1, pp.5-20, 2000.
DOI : 10.1007/s004530010002

Y. C. Yap, Robust geometric computation, Handbook of Discrete and Computational Geometry, chapter 41, 2004.
DOI : 10.1007/978-0-387-30162-4_349
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.7.3934