F. Aurenhammer, Power Diagrams: Properties, Algorithms and Applications, SIAM Journal on Computing, vol.16, issue.1, p.7896, 1987.
DOI : 10.1137/0216006

H. Brönnimann, L. Kettner, S. Schirra, and R. Veltkamp, Applications of the Generic Programming Paradigm in the Design of CGAL, Lecture Notes in Computer Science, vol.1766, p.206216, 2000.
DOI : 10.1007/3-540-39953-4_16

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

. Cgal, Computational Geometry Algorithms Library

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

C. Delage, Spatial sorting, CGAL User and Reference Manual. 3.3 edition, 2007.

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

O. Devillers, S. Pion, and M. Teillaud, Walking in a triangulation, Internat. J. Found. Comput. Sci, vol.13, p.181199, 2002.
URL : https://hal.archives-ouvertes.fr/inria-00344519

O. Devillers and M. Teillaud, Perturbations and vertex removal in a 3D Delaunay triangulation, Proc. 14th ACM-SIAM Sympos. Discrete Algorithms (SODA), p.319, 2003.
URL : https://hal.archives-ouvertes.fr/inria-00166710

O. Devillers and M. Teillaud, Perturbations and vertex removal in delaunay and regular 3d triangulations, Research Report, vol.5968, 2006.
URL : https://hal.archives-ouvertes.fr/inria-00090522

N. [. Edelsbrunner and . Shah, Incremental topological ipping works for regular triangulations, Algorithmica, vol.15, p.223241, 1996.

[. Fogel and M. Teillaud, Generic programming and the CGAL library, Eective Computational Geometry for Curves and Surfaces, 2006.
URL : https://hal.archives-ouvertes.fr/hal-01053388

E. Gamma, R. Helm, R. Johnson, and J. Vlissides, Design Patterns, 1995.

]. M. Hel01 and . Held, Vroni: An engineering approach to the reliable and ecient computation of Voronoi diagrams of points and line segments, Comput. Geom. Theory Appl, vol.18, p.95123, 2001.

S. Pion and M. Teillaud, 3d triangulation data structure, CGAL User and Reference Manual. 3.3 edition, 2007.

G. Rote and G. Vegter, Computational Topology: An Introduction, Eective Computational Geometry for Curves and Surfaces, 2006.
DOI : 10.1007/978-3-540-33259-6_7
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.121.7283

]. J. She96 and . Shewchuk, Triangle: Engineering a 2d quality mesh generator and Delaunay triangulator, First Workshop on Applied Computational Geometry, 1996.

R. Wein, B. Fogel, D. Zukerman, and . Halperin, Advanced programming techniques applied to Cgal's arrangement package, Computational Geometry, vol.38, issue.1-2, p.3763, 2007.
DOI : 10.1016/j.comgeo.2006.11.007
URL : http://doi.org/10.1016/j.comgeo.2006.11.007

A. Zomorodian, Topology for Computing, 2005.
DOI : 10.1017/CBO9780511546945

I. Unité-de-recherche-inria-sophia and . Antipolis, route des Lucioles -BP 93 -06902 Sophia Antipolis Cedex (France) Unité de recherche INRIA Futurs : Parc Club Orsay Université -ZAC des Vignes 4, 2004.

I. Unité-de-recherche and . Lorraine, Technopôle de Nancy-Brabois -Campus scientifique 615, rue du Jardin Botanique -BP 101 -54602 Villers-lès-Nancy Cedex (France) Unité de recherche INRIA Rennes : IRISA, Campus universitaire de Beaulieu -35042 Rennes Cedex (France) Unité de recherche INRIA Rhône-Alpes : 655, avenue de l'Europe -38334 Montbonnot Saint-Ismier (France) Unité de recherche INRIA Rocquencourt, Domaine de Voluceau -Rocquencourt -BP 105 -78153 Le Chesnay Cedex

I. De-voluceau-rocquencourt, BP 105 -78153 Le Chesnay Cedex (France) http://www.inria.fr ISSN, pp.249-6399