F. P. Preparata and M. I. Shamos, Computational Geometry: an Introduction, 1985.

H. Edelsbrunner, Algorithms in Combinatorial Geometry, EATCS Monographs on Theoretical Computer Science, vol.10, 1987.

F. Aurenhammer, Voronoi diagrams: a survey of a fundamental geometric data structure, ACM Comput. Surv, vol.23, pp.345-405, 1991.

R. Seidel, Constructing higher-dimensional convex hulls at logarithmic cost per face, Proc. 18th Annu. ACM Sympos. Theory Comput, pp.404-413, 1986.

J. Matou?ek and O. Schwarzkopf, Linear optimization queries, Proc. 8th Annu. ACM Sympos, pp.16-25, 1992.

K. L. Clarkson and P. W. Shor, Applications of random sampling in computational geometry, II. Discrete Comput. Geom, vol.4, pp.387-421, 1989.

J. Boissonnat, O. Devillers, R. Schott, M. Teillaud, and M. Yvinec, Applications of random sampling to on-line algorithms in computational geometry, Discrete Comput. Geom, vol.8, pp.51-71, 1992.
URL : https://hal.archives-ouvertes.fr/inria-00075274

J. Boissonnat, A. Cérézo, O. Devillers, and M. Teillaud, Outputsensitive construction of the 3-d Delaunay triangulation of constrained sets of points, Proc. 3rd Canad. Conf, pp.110-113, 1991.
URL : https://hal.archives-ouvertes.fr/hal-01180159

H. Bruggesser and P. Mani, Shellable decompositions of cells and spheres, Math. Scand, vol.29, pp.197-205, 1971.

J. Boissonnat, A. Cérézo, O. Devillers, and M. Teillaud,

J. Boissonnat, Shape reconstruction from planar cross-sections, Comput. Vision Graph. Image Process, vol.44, issue.1, pp.1-29, 1988.
URL : https://hal.archives-ouvertes.fr/inria-00076008

F. Aurenhammer, Power diagrams: properties, algorithms and applications, SIAM J. Comput, vol.16, pp.78-96, 1987.

H. S. Coxeter, Introduction to Geometry, 1961.

D. Pedoe, Geometry, a comprehensive course, 1970.

O. Devillers, S. Meiser, and M. Teillaud, The space of spheres, a geometric tool to unify duality results on Voronoi diagrams, Proc. 4th Canad. Conf, pp.263-268, 1992.
URL : https://hal.archives-ouvertes.fr/hal-01180157

L. J. Guibas and R. Seidel, Computing convolutions by reciprocal search, Discrete Comput. Geom, vol.2, pp.175-193, 1987.

H. Edelsbrunner and L. J. Guibas, Topologically sweeping an arrangement, J. Comput. Syst. Sci, vol.38, pp.249-251, 1989.

A. F. Beardon, The Geometry of Discrete Groups. Graduate Texts in Mathematics, 1983.

A. Cérézo, Le plan hyperboliqueà pied, puis un bond dans l'espace. Publication pédagogique 10, 1991.