F. Aurenhammer, Voronoi diagrams---a survey of a fundamental geometric data structure, ACM Computing Surveys, vol.23, issue.3, pp.345-405, 1991.
DOI : 10.1145/116873.116880

C. B. Barber, D. P. Dobkin, and H. Huhdanpaa, The quickhull algorithm for convex hulls, ACM Transactions on Mathematical Software, vol.22, issue.4, pp.469-483, 1996.
DOI : 10.1145/235815.235821

M. Bern and D. Eppstein, MESH GENERATION AND OPTIMAL TRIANGULATION, Computing in Euclidean Geometry, pp.23-90, 1992.
DOI : 10.1142/9789814355858_0002

Y. Bertrand and J. Dufourd, Algebraic Specification of a 3D-Modeler Based on Hypermaps, CVGIP: Graphical Models and Image Processing, vol.56, issue.1, pp.29-60, 1994.
DOI : 10.1006/cgip.1994.1005

J. Boissonnat and M. Yvinec, Algorithmic Geometry, 1998.
DOI : 10.1017/CBO9781139172998

E. Brisson, Representing geometric structures ind dimensions: Topology and order, Discrete & Computational Geometry, vol.5, issue.1, pp.387-426, 1993.
DOI : 10.1007/BF02189330
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.188.3948

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.

D. Cazier and J. Dufourd, A formal specification of geometric refinements, The Visual Computer, vol.15, issue.6, 2000.
DOI : 10.1007/s003710050178
URL : https://hal.archives-ouvertes.fr/hal-01208568

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

R. Mark-de-berg, M. Van-oostrum, and . Overmars, Simple traversal of a subdivision without extra storage, Proceedings of the twelfth annual symposium on Computational geometry , SCG '96, pp.5-6, 1996.
DOI : 10.1145/237218.237408

O. Devillers, THE DELAUNAY HIERARCHY, International Journal of Foundations of Computer Science, vol.13, issue.02
DOI : 10.1142/S0129054102001035
URL : https://hal.archives-ouvertes.fr/inria-00166711

O. Devillers, Improved incremental randomized Delaunay triangulation, Proceedings of the fourteenth annual symposium on Computational geometry , SCG '98, pp.106-115, 1998.
DOI : 10.1145/276884.276896
URL : https://hal.archives-ouvertes.fr/hal-01179446

O. Devillers, G. Liotta, P. Franco, R. Preparata, and . Tamassia, Checking the convexity of polytopes and the planarity of subdivisions, Computational Geometry, vol.11, issue.3-4, pp.187-208, 1998.
DOI : 10.1016/S0925-7721(98)00039-X
URL : https://hal.archives-ouvertes.fr/hal-01179691

O. Devillers, S. Pion, and M. Teillaud, Walking in a triangulation, Proc. 17th Annual ACM Symposium on Computational Geometry, pp.106-114, 2001.
URL : https://hal.archives-ouvertes.fr/inria-00344519

O. Devillers, S. Pion, and M. Teillaud, Walking in a triangulation, Research Report, vol.4120, 2001.
URL : https://hal.archives-ouvertes.fr/inria-00344519

R. A. Dwyer, A simple divide-and-conquer algorithm for computing Delaunay triangulations in O(n log log n) expected time, Proceedings of the second annual symposium on Computational geometry , SCG '86, pp.276-284, 1986.
DOI : 10.1145/10515.10545

R. A. Dwyer, A faster divide-and-conquer algorithm for constructing delaunay triangulations, Algorithmica, vol.21, issue.1-4, pp.137-151, 1987.
DOI : 10.1007/BF01840356

H. Edelsbrunner and R. Seidel, Voronoi diagrams and arrangements, Discrete & Computational Geometry, vol.24, issue.1, pp.25-44, 1986.
DOI : 10.1007/BF02187681

H. Edelsbrunner and T. S. Tan, An upper bound for conforming Delaunay triangulations, Discrete & Computational Geometry, vol.134, issue.2, pp.197-213, 1993.
DOI : 10.1007/BF02573974

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, 1998.
DOI : 10.1002/1097-024X(200009)30:11<1167::AID-SPE337>3.0.CO;2-B

E. Flato, D. Halperin, I. Hanniel, and O. Nechushtan, The Design and Implementation of Planar Maps in CGAL, Abstracts 15th European Workshop Comput. Geom, pp.169-172, 1999.
DOI : 10.1007/3-540-48318-7_14

E. G. Flekky, P. V. Coveney, and G. De-fabritiis, Foundations of dissipative particle dynamics, Physical Review E, vol.62, issue.2, p.2140, 2000.
DOI : 10.1103/PhysRevE.62.2140

P. George and H. Borouchaki, Triangulation de Delaunay et maillage. Applications auxélémentsauxéléments finis, Hermes, 1997.

T. Granlund and . Gmp, The GNU Multiple Precision Arithmetic Library , 2.0.2 edition, 1996.

L. J. Guibas and J. Stolfi, Primitives for the manipulation of general subdivisions and the computation of Voronoi diagrams, Proceedings of the fifteenth annual ACM symposium on Theory of computing , STOC '83, pp.74-123, 1985.
DOI : 10.1145/800061.808751

F. Hoffmann, K. Kriegel, and C. Wenk, A geometric approach to protein identification in 2D electrophoretic gel images, Abstracts 15th European Workshop Comput. Geom, pp.173-174, 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

P. Lienhardt, N-DIMENSIONAL GENERALIZED COMBINATORIAL MAPS AND CELLULAR QUASI-MANIFOLDS, International Journal of Computational Geometry & Applications, vol.04, issue.03, pp.275-324, 1994.
DOI : 10.1142/S0218195994000173

P. Ernst, I. Mücke, B. Saias, and . Zhu, Fast randomized point location without preprocessing in two-and three-dimensional Delaunay triangulations, Proc. 12th Annu. ACM Sympos, pp.274-283, 1996.

K. Mulmuley, Randomized multidimensional search trees: Dynamic sampling, Proc. 7th Annu. ACM Sympos, pp.121-131, 1991.

M. Murphy, D. M. Mount, and C. W. Gable, A POINT-PLACEMENT STRATEGY FOR CONFORMING DELAUNAY TETRAHEDRALIZATION, Proc. 11th ACM- SIAM Sympos. Discrete Algorithms, pp.67-74, 2000.
DOI : 10.1142/S0218195901000699

S. Pion, De la géométrie algorithmique au calcul géométrique, Thèse de doctorat en sciences, université de Nice, 1999.

S. Pion, Interval arithmetic: An efficient implementation and an application to computational geometry, Workshop on Applications of Interval Analysis to systems and Control, pp.99-110, 1999.
URL : https://hal.archives-ouvertes.fr/inria-00344513

E. Schnhardt, ???ber die Zerlegung von Dreieckspolyedern in Tetraeder, Mathematische Annalen, vol.98, issue.1, pp.309-312, 1928.
DOI : 10.1007/BF01451597

J. R. Shewchuk, Triangle: Engineering a 2D quality mesh generator and Delaunay triangulator, First Workshop on Applied Computational Geometry, 1996.
DOI : 10.1007/BFb0014497

J. Shewchuk and . Triangle, A two-dimensional quality mesh generator and Delaunay triangulator

J. R. Shewchuk, Robust adaptive floating-point geometric predicates, Proceedings of the twelfth annual symposium on Computational geometry , SCG '96, pp.141-150, 1996.
DOI : 10.1145/237218.237337
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.53.6004

J. R. Shewchuk, A condition guaranteeing the existence of higherdimensional constrained Delaunay triangulations, Proc. 14th Annu

C. Remco and . Veltkamp, Generic programming in CGAL, the Computational Geometry Algorithms Library, Proceedings of the 6th Eurographics Workshop on Programming Paradigms in Graphics, pp.127-138, 1997.