N. Amenta, S. Choi, and R. K. Kolluri, The power crust, unions of balls, and the medial axis transform, Computational Geometry, vol.19, issue.2-3, pp.127-153, 2001.
DOI : 10.1016/S0925-7721(01)00017-7

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

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

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

R. L. Drysdale, D. T. Iii, and . Lee, Generalized Voronoi diagrams in the plane, Proc. 16th Allerton Conf. Commun. Control Comput, pp.833-842, 1978.

S. Fortune, A sweepline algorithm for Voronoi diagrams, Proc. 2nd Annu. ACM Sympos, pp.313-322, 1986.

M. Karavelas, Proximity Structures for Moving Objects in Constrained and Unconstrained Environments, 2001.

I. Menelaos, I. Z. Karavelas, and . Emiris, Predicates for the planar additively weighted Voronoi diagram, 2002.

D. Kim, D. Kim, and K. Sugihara, Voronoi Diagram of a Circle Set Constructed from Voronoi Diagram of a Point Set, Proc. 11th Inter. Conf. ISAAC, pp.432-443, 1969.
DOI : 10.1007/3-540-40996-3_37

D. Kim, D. Kim, K. Sugihara, and J. Ryu, Robust and Fast Algorithm for a Circle Set Voronoi Diagram in a Plane, Proceedings of the 2001 International Conference on Computational Science, pp.718-727
DOI : 10.1007/3-540-45545-0_83

R. Klein, Concrete and Abstract Voronoi Diagrams, Lecture Notes Comput. Sci, vol.400, 1989.
DOI : 10.1007/3-540-52055-4

R. Klein, K. Mehlhorn, and S. Meiser, Randomized incremental construction of abstract Voronoi diagrams, Computational Geometry, vol.3, issue.3, pp.157-184, 1993.
DOI : 10.1016/0925-7721(93)90033-3

D. T. Lee, R. L. Drysdale, and I. , Generalization of Voronoi Diagrams in the Plane, SIAM Journal on Computing, vol.10, issue.1, pp.73-87, 1981.
DOI : 10.1137/0210006

K. Mehlhorn, S. Meiser, and C. Ó. Dúnlaing, On the construction of abstract voronoi diagrams, Discrete & Computational Geometry, vol.14, issue.2, pp.211-224, 1991.
DOI : 10.1007/BF02574686

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

M. Sharir, Intersection and Closest-Pair Problems for a Set of Planar Discs, SIAM Journal on Computing, vol.14, issue.2, pp.448-468, 1985.
DOI : 10.1137/0214034

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 -38330 Montbonnot-St, 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