N. Amenta and M. Bern, Surface Reconstruction by Voronoi Filtering, Discrete & Computational Geometry, vol.22, issue.4, pp.481-504, 1999.

N. Amenta, D. Attali, and O. Devillers, Complexity of Delaunay triangulation for points on lower-dimensional polyhedra, 18th ACM-SIAM Symposium on Discrete Algorithms, pp.1106-1113, 2007.
URL : https://hal.archives-ouvertes.fr/inria-00098300

N. Amenta, S. Choi, and G. Rote, Incremental constructions con BRIO, Proc. 19th Annual Symposium on Computational geometry, pp.211-219, 2003.

D. Attali and J. Boissonnat, A Linear Bound on the Complexity of the Delaunay Triangulation of Points on Polyhedral Surfaces. Discrete & Computational Geometry, vol.31, pp.369-384, 2004.
URL : https://hal.archives-ouvertes.fr/inria-00072135

D. Attali, J. Boissonnat, and A. Lieutier, Complexity of the Delaunay Triangulation of Points on Surfaces: the Smooth Case, Proceedings of the Nineteenth Annual Symposium on Computational Geometry, SCG '03, pp.201-210, 2003.

L. Bieberbach, Über die Bewegungsgruppen des n-dimensionalen euklidischen Raumes mit einem endlichen Fundamentalbereich, Göttinger Nachrichten, vol.75, 1910.

M. Boileau, S. Maillot, and J. Porti, Three-dimensional orbifolds and their geometric structures. Société mathématique de France, 2003.

J. Boissonnat and F. Cazals, Smooth surface reconstruction via natural neighbour interpolation of distance functions, 16th ACM Symposium on Computational Geometry, vol.22, pp.185-203, 2002.
URL : https://hal.archives-ouvertes.fr/inria-00072662

J. Boissonnat, O. Devillers, and S. Hornus, Incremental construction of the delaunay triangulation and the delaunay graph in medium dimension, Proceedings of the Twenty-fifth Annual Symposium on Computational Geometry, SCG '09, pp.208-216, 2009.

J. Boissonnat and M. Teillaud, On the randomized construction of the Delaunay tree, Theoretical Computer Science, vol.112, issue.93, p.90024, 1993.
URL : https://hal.archives-ouvertes.fr/inria-00075419

M. Caroli and M. Teillaud, Delaunay triangulations of closed Euclidean dorbifolds. Discrete and Computational Geometry, vol.55, pp.827-853, 2016.
URL : https://hal.archives-ouvertes.fr/hal-01294409

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

M. , L. D. Weiss, and T. M. Raschke, How hydrophobic buckminsterfullerene affects surrounding water structure, Journal of Physical Chemistry, vol.112, issue.10, pp.2981-2990, 2008.

O. Devillers, Randomization yields simple o(n log n) algorithms for difficult ?(n) problems, International Journal of Computational Geometry and Applications, vol.2, issue.1, pp.97-111, 1992.
URL : https://hal.archives-ouvertes.fr/inria-00167206

O. Devillers, The Delaunay hierarchy, International Journal of Foundations of Computer Science, vol.13, p.166711, 2002.
URL : https://hal.archives-ouvertes.fr/inria-00166711

R. A. Dwyer, The expected number of k-faces of a Voronoi diagram, Computers & Mathematics with Applications, vol.26, issue.5, pp.13-19, 1993.

R. A. Dwyer, Higher-dimensional Voronoi diagrams in linear expected time, Discrete & Computational Geometry, vol.6, issue.3, pp.343-367, 1991.

J. Erickson, Nice Point Sets Can Have Nasty Delaunay Triangulations, Proceedings of the Seventeenth Annual Symposium on Computational Geometry, SCG '01, pp.96-105, 2001.

J. Erickson, Dense Point Sets Have Sparse Delaunay Triangulations or, Discrete & Computational Geometry, vol.33, issue.1, pp.83-115, 2005.

P. V. Gianni-de-fabritiis, E. G. Coveney, and . Flekkøy, Multiscale dissipative particle dynamics, Philosophical Transactions: Mathematical, Physical and Engineering Sciences, vol.360, pp.317-331, 1792.

E. N. Gilbert, Random subdivisions of space into crystals, Ann. Math. Statist, vol.33, issue.3, pp.958-972, 1962.

J. Mordecai, H. Golin, and . Na, On the average complexity of 3d-Voronoi diagrams of random points on convex polytopes, Computational Geometry, vol.25, issue.3, pp.197-231, 2003.

J. L. Meijering, Interface area, edge length, and number of vertices in crystal aggregates with random nucleation, Philips Research Reports, vol.8, pp.270-290, 1953.

R. E. Miles, The random division of space, Advances in Applied Probability, vol.4, pp.243-266, 1972.

L. Gary, D. R. Miller, and . Sheehy, A new approach to output-sensitive construction of voronoi diagrams and delaunay triangulations, Discrete Comput. Geom, vol.52, issue.3, pp.476-491, 2014.

G. L. Miller, D. R. Sheehy, and A. Velingker, A fast algorithm for wellspaced points and approximate delaunay graphs, Symposuim on Computational Geometry 2013, SoCG '13, pp.289-298, 2013.
URL : https://hal.archives-ouvertes.fr/hal-00924494

J. Møller, Random tessellations in R d, Advances in Applied Probability, vol.21, issue.1, pp.37-73, 1989.

R. Motwani and P. Raghavan, Randomized Algorithms, 1995.

K. Mulmuley, Computational geometry -an introduction through randomized algorithms, 1994.

V. Robins, Betti number signatures of homogeneous poisson point processes, Phys. Rev. E, vol.74, p.61107, 2006.

D. Talmor, Well-Spaced Points for Numerical Methods, 1997.

P. William and . Thurston, Three-Dimensional Geometry and Topology, vol.1, 2014.

V. M. Tikhomirov, Entropy and -Capacity of sets in functional spaces, pp.86-170, 1993.

E. Rien-van-de-weygaert, G. Platen, B. Vegter, N. Eldering, and . Kruithof, Alpha shape topology of the cosmic web, Proceedings of the 2010 International Symposium on Voronoi Diagrams in Science and Engineering, ISVD '10, pp.224-234, 2010.

, Wikipedia