A. M. 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

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

J. E. Baker, R. Tamassia, L. Vismara, and . Geomlib, Algorithm engineering for a geometric computing library, p.80, 1997.

H. Brönnimann, C. Burnikel, and S. Pion, Interval arithmetic yields efficient dynamic filters for computational geometry, Proc. 14th Annu. ACM Sympos, pp.165-174, 1998.

H. Brönnimann, L. Kettner, S. Schirra, and R. Veltkamp, Applications of the Generic Programming Paradigm in the Design of CGAL, Generic Programming?Proceedings of a Dagstuhl Seminar, p.80, 2000.
DOI : 10.1007/3-540-39953-4_16

C. Burnikel, K. Mehlhorn, and S. Schirra, The LEDA class real number, p.88, 1996.

J. Coplien, Curiously recurring template patterns, C++ Report, pp.24-27, 1995.

M. De-berg, M. Van-kreveld, M. Overmars, and O. Schwarzkopf, Computational Geometry: Algorithms and Applications, 1997.

A. Fabri, G. Giezeman, L. Kettner, S. Schirra, and S. Schönherr, The CGAL kernel: A basis for geometric computation, Proc. 1st ACM Workshop on Appl, pp.191-202, 1996.
DOI : 10.1007/BFb0014496

A. Fabri, G. Giezeman, L. Kettner, S. Schirra, and S. Schönherr, On the design of CGAL a computational geometry algorithms library, Software: Practice and Experience, vol.12, issue.11, pp.1167-1202, 2000.
DOI : 10.1002/1097-024X(200009)30:11<1167::AID-SPE337>3.0.CO;2-B

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

G. Giezeman, PlaGeo, a library for planar geometry, and SpaGeo, a library for spatial geometry, p.80, 1994.

N. M. Josuttis, The C++ Standard Library, A Tutorial and Reference, p.85, 1999.

L. Kettner, Using generic programming for designing a data structure for polyhedral surfaces, Computational Geometry, vol.13, issue.1, pp.65-90, 1999.
DOI : 10.1016/S0925-7721(99)00007-3

K. Mehlhorn, S. Näher, and . Leda, A Platform for Combinatorial and Geometric Computing, p.80, 2000.

D. R. Musser and A. A. Stepanov, Generic programming, 1st Intl. Joint Conf. of ISSAC-88 and AAEC-6, pp.13-25, 1989.
DOI : 10.1007/3-540-51084-2_2

D. R. Musser and A. A. Stepanov, Algorithm-oriented generic libraries, Software: Practice and Experience, vol.21, issue.7, pp.623-642, 1994.
DOI : 10.1002/spe.4380240703

N. C. Myers, Traits: A new and useful template technique, C++ Report, 1995.

S. Schirra, A Case Study on the Cost of Geometric Computing, Proc. Workshop on Algorithm Engineering and Experimentation, pp.156-176, 1999.
DOI : 10.1007/3-540-48518-X_10

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

B. Stroustrup, The C++ Programming Language, p.80, 1997.

T. Veldhuizen, Techniques for scientific C++, p.85, 2000.

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