E. Aganj, J. Pons, F. Ségonne, and R. Keriven, Spatio-Temporal Shape from Silhouette using Four-Dimensional Delaunay Meshing, 2007 IEEE 11th International Conference on Computer Vision, 2007.
DOI : 10.1109/ICCV.2007.4409016

URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=

N. Amenta, S. Choi, and G. Rote, Incremental constructions con BRIO, Proceedings of the nineteenth conference on Computational geometry , SCG '03, pp.211-219, 2003.
DOI : 10.1145/777792.777824

URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=

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

URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=

J. Boissonnat and M. Teillaud, On the randomized construction of the Delaunay tree, Theoretical Computer Science, vol.112, issue.2, pp.339-354, 1993.
DOI : 10.1016/0304-3975(93)90024-N

URL : https://hal.archives-ouvertes.fr/inria-00075419

H. Brönnimann, C. Burnikel, and S. Pion, Interval arithmetic yields efficient dynamic filters for computational geometry, the 14th annual ACM symposium on Computational Geometry, pp.25-47, 1998.
DOI : 10.1016/S0166-218X(00)00231-6

A. R. Butz, Alternative Algorithm for Hilbert's Space-Filling Curve, IEEE Transactions on Computers, vol.20, issue.4, pp.424-426, 1971.
DOI : 10.1109/T-C.1971.223258

K. Clarkson, Safe and effective determinant evaluation, Proceedings., 33rd Annual Symposium on Foundations of Computer Science, pp.387-395, 1992.
DOI : 10.1109/SFCS.1992.267751

URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=

K. Clarkson, K. Mehlhorn, and R. Seidel, Four results on randomized incremental constructions, Computational Geometry, vol.3, issue.4, pp.185-212, 1993.
DOI : 10.1016/0925-7721(93)90009-U

URL : http://dx.doi.org/10.1016/0925-7721(93)90009-u

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

R. A. Dwyer, Higher-dimensional voronoi diagrams in linear expected time, SCG '89: Proceedings of the fifth annual symposium on Computational geometry, pp.326-333, 1989.
DOI : 10.1007/bf02574694

M. Hemmer, S. Hert, L. Kettner, S. Pion, and S. Schirra, Number types, CGAL User and Reference Manual. CGAL, 3.3 edition, 2007.

M. Isenburg, Y. Liu, J. Shewchuk, and J. Snoeyink, Streaming computation of Delaunay triangulations, ACM Transactions on Graphics, vol.25, issue.3, pp.1049-1056, 2006.
DOI : 10.1145/1141911.1141992

G. Jin and J. Mellor-crummey, SFCGen: A framework for efficient generation of multi-dimensional space-filling curves by recursion, ACM Transactions on Mathematical Software, vol.31, issue.1, pp.120-148, 2005.
DOI : 10.1145/1055531.1055537

P. Kumar and E. A. Ramos, I/o-efficient construction of voronoi diagrams, 2003.

K. Mulmuley, Computational Geometry: An Introduction Through Randomized Algorithms, 1994.

J. R. Shewchuk, Triangle: Engineering a 2D quality mesh generator and Delaunay triangulator, Applied Computational Geometry: Towards Geometric Engineering From the First ACM Workshop on Applied Computational Geometry, pp.203-222, 1996.
DOI : 10.1007/BFb0014497

J. Süssmuth, M. Winter, and G. Greiner, Reconstructing Animated Meshes from Time-Varying Point Clouds, Computer Graphics Forum, vol.45, issue.12, pp.1469-1476, 2008.
DOI : 10.1111/j.1467-8659.2008.01287.x