M. Aanjaneya, M. Gao, H. Liu, C. Batty, and E. Sifakis, Power diagrams and sparse paged grids for high resolution adaptive liquids, ACM Trans. Graph, vol.36, p.12, 2017.

S. Alexander and L. Rainald, Three-dimensional parallel unstructured grid generation, Internat. J. Numer. Methods Engrg, vol.38, pp.905-925, 1995.

N. Amenta, S. Choi, T. K. Dey, and N. Leekha, A Simple Algorithm for Homeomorphic Surface Reconstruction, Int. J. Comput. Geometry Appl, vol.12, pp.125-141, 2002.

N. Amenta, S. Choi, and G. Rote, Incremental constructions con BRIO, Proceedings of the 19th ACM Symposium on Computational Geometry, pp.211-219, 2003.

R. J. Barrientos, F. Millaguir, J. L. Sánchez, and E. Arias, GPU-based Exhaustive Algorithms Processing kNN Queries, J. Supercomput, vol.73, pp.4611-4634, 2017.

H. F. Vincente, D. L. Batista, S. Millman, J. Pion, and . Singler, Parallel geometric algorithms for multi-core computers, Internat. J. Numer. Methods Engrg, vol.43, pp.663-677, 2010.

D. Boltcheva and B. Lévy, Surface reconstruction by computing restricted Voronoi cells in parallel, Computer-Aided Design, vol.90, pp.123-134, 2017.
URL : https://hal.archives-ouvertes.fr/hal-01596553

, Publication date, ACM Trans. Graph, vol.37, issue.6, 2018.

A. Bowyer, Computing Dirichlet Tessellations. Comput. J, vol.24, pp.162-166, 1981.

Y. Brenier, U. Frisch, M. Henon, G. Loeper, S. Matarrese et al., Reconstruction of the early Universe as a convex optimization problem. arXiv, 2003.
URL : https://hal.archives-ouvertes.fr/hal-00012457

T. Brochu, C. Batty, and R. Bridson, Matching fluid simulation elements to surface geometry and topology, ACM Trans. Graph, vol.29, p.9, 2010.

T. Cao, Fundamental Computational Geometry on the GPU, 2014.

T. Cao, A. Nanjappa, M. Gao, and T. Tan, A GPU accelerated algorithm for 3D Delaunay triangulation, Symposium on Interactive 3D Graphics and Games, I3D '14, pp.47-54, 2014.

N. Cuntz and A. Kolb, Fast Hierarchical 3D Distance Transforms on the GPU, The Eurographics Association, 2007.

H. L. De-cougny and M. Shephard, Parallel refinement and coarsening of tetrahedral meshes, Internat. J. Numer. Methods Engrg, vol.46, pp.1101-1125, 1999.

C. Fernando-de-goes, J. Wallez, D. Huang, M. Pavlov, and . Desbrun, Power particles: an incompressible fluid solver based on power diagrams, ACM Trans. Graph, vol.34, 2015.

C. Delage and O. Devillers, CGAL Editorial Board, 2018.

Q. Du, V. Faber, and M. Gunzburger, Centroidal Voronoi Tessellations: Applications and Algorithms, SIAM Rev, vol.41, pp.637-676, 1999.
DOI : 10.1137/s0036144599352836

URL : http://people.sc.fsu.edu/~mgunzburger/files_papers/gunzburger-cvt-siamreview.pdf

H. Edelsbrunner and E. P. Mücke, Simulation of simplicity: a technique to cope with degenerate cases in geometric algorithms, 1994.

Y. Fei, G. Rong, B. Wang, and W. Wang, Parallel L-BFGS-B algorithm on GPU, Computers & Graphics, vol.40, pp.1-9, 2014.
DOI : 10.1016/j.cag.2014.01.002

I. Fischer and C. Gotsman, Fast Approximation of High-Order Voronoi Diagrams and Distance Transforms on the GPU, J. Graphics Tools, vol.11, pp.39-60, 2006.
DOI : 10.1080/2151237x.2006.10129229

URL : https://dash.harvard.edu/bitstream/handle/1/24019793/tr-07-05.pdf?sequence=1

O. Thomas, Q. Gallouët, and . Mérigot, A Lagrangian Scheme à la Brenier for the Incompressible Euler Equations, Foundations of Computational Mathematics, 2017.

E. Garcia, M. Debreuve, and . Barlaud, Fast k nearest neighbor search using GPU, IEEE Computer Society Conference on Computer Vision and Pattern Recognition Workshops. 1-6, 2008.
DOI : 10.1109/cvprw.2008.4563100

URL : https://hal.archives-ouvertes.fr/hal-00374684

V. Garcia, E. Debreuve, F. Nielsen, and M. Barlaud, K-nearest neighbor search: Fast GPU-based implementations and application to high-dimensional feature matching, 2010 IEEE International Conference on Image Processing, pp.3757-3760, 2010.
DOI : 10.1109/icip.2010.5654017

URL : http://blog.informationgeometry.org/resources/2010_ICIP-KNN-Paper.pdf

R. E. González, PARAVT: Parallel Voronoi tessellation code, Astronomy and Computing, vol.17, pp.80-85, 2016.

. Rc-hoetzlein, Fast fixed-radius nearest neighbors: interactive million-particle fluids, GPU Technology Conference, vol.18, 2014.

K. E. Hoff, I. , J. Keyser, M. Lin, D. Manocha et al., Fast Computation of Generalized Voronoi Diagrams Using Graphics Hardware, Proceedings of the 26th Annual Conference on Computer Graphics and Interactive Techniques (SIGGRAPH '99, pp.277-286, 1999.
DOI : 10.1145/336154.336226

A. Inria, Geogram: a programming library of geometric algorithms, 2018.

B. Lévy, Robustness and efficiency of geometric programs: The Predicate Construction Kit (PCK), Computer-Aided Design, vol.72, pp.3-12, 2016.

B. Lévy and N. Bonneel, Variational Anisotropic Surface Meshing with Voronoi Parallel Linear Enumeration, Proceedings of the 21st International Meshing Roundtable, pp.349-366, 2013.

B. Lévy and Y. Liu, L p Centroidal Voronoi Tessellation and its applications, ACM Trans. Graph, vol.29, p.11, 2010.

S. Li and N. Amenta, Brute-Force k-Nearest Neighbors Search on the GPU, Proceedings of the 8th International Conference on Similarity Search and Applications, vol.9371, pp.259-270, 2015.
DOI : 10.1007/978-3-319-25087-8_25

Y. Liu, W. Wang, B. Lévy, F. Sun, D. Yan et al., On centroidal voronoi tessellation-energy smoothness and fast computation, ACM Trans. Graph, vol.28, pp.1-101, 2009.
DOI : 10.1145/1559755.1559758

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

P. Stuart and . Lloyd, Least squares quantization in pcm, IEEE Transactions on Information Theory, vol.28, pp.129-137, 1982.

C. Marot, J. Pellerin, and J. Remacle, One Machine, One minute, Three billion tetrahedra, 2018.
DOI : 10.1002/nme.5987

URL : http://arxiv.org/pdf/1805.08831

G. Melquiond and . Sylvain-pion, Formally certified floating-point filters for homogeneous geometric predicates, ITA, vol.41, pp.57-69, 2007.
DOI : 10.1051/ita:2007005

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

C. Nikos and N. Damian, Parallel Delaunay mesh generation kernel, Internat. J. Numer. Methods Engrg, vol.58, pp.161-176, 2003.

T. Peterka, D. Morozov, and C. Phillips, High-Performance Computation of Distributed-Memory Parallel 3D Voronoi and Delaunay Tessellation, Proceedings of the International Conference for High Performance Computing, Networking, Storage and Analysis, pp.997-1007, 2014.
DOI : 10.1109/sc.2014.86

URL : https://cloudfront.escholarship.org/dist/prd/content/qt6bf5k7dz/qt6bf5k7dz.pdf?t=p0viin

J. Remacle, A two-level multithreaded Delaunay kernel, ComputerAided Design, vol.85, pp.2-9, 2017.
DOI : 10.1016/j.proeng.2015.10.118

URL : https://doi.org/10.1016/j.proeng.2015.10.118

G. Rong, Y. Liu, W. Wang, X. Yin, D. Gu et al., GPU-Assisted Computation of Centroidal Voronoi Tessellation, IEEE Transactions on Visualization and Computer Graphics, vol.17, issue.3, pp.345-356, 2011.
URL : https://hal.archives-ouvertes.fr/inria-00602490

G. Rong and T. Tan, Jump Flooding in GPU with Applications to Voronoi Diagram and Distance Transform, Proceedings of the 2006 Symposium on Interactive 3D Graphics and Games (I3D '06, pp.109-116, 2006.
DOI : 10.1145/1111411.1111431

URL : http://www.comp.nus.edu.sg/~tants/jfa/i3d06.pdf

C. Rycroft, Voro++: A Three-Dimensional Voronoi Cell Library in C++, vol.19, p.41111, 2009.
DOI : 10.1063/1.3215722

URL : https://aip.scitation.org/doi/pdf/10.1063/1.3215722

J. Schneider, M. Kraus, and R. Westermann, GPU-Based Euclidean Distance Transforms and Their Application to Volume Rendering, Computer Vision, pp.215-228, 2010.
DOI : 10.1007/978-3-642-11840-1_16

J. R. Shewchuk, Robust Adaptive Floating-Point Geometric Predicates, Proceedings of the Twelfth Annual Symposium on Computational Geometry, pp.141-150, 1996.
DOI : 10.1145/237218.237337

C. Sigg, R. Peikert, and M. Gross, Signed distance transform using graphics hardware, IEEE Visualization, 2003. VIS 2003. 83-90, 2003.
DOI : 10.1109/visual.2003.1250358

F. Sin, A. W. Bargteil, and J. K. Hodgins, A Point-based Method for Animating Incompressible Flow, Proceedings of the 2009 ACM SIGGRAPH/Eurographics Symposium on Computer Animation (SCA '09), pp.247-255, 2009.
DOI : 10.1145/1599470.1599502

URL : http://sealab.cs.utah.edu/Papers/Sin-2009-APB/Sin-2009-APB.pdf

. Volker-springel, Moving-mesh hydrodynamics with the AREPO code, Computational Star Formation, 2011.

A. Sud, N. Govindaraju, R. Gayle, and D. Manocha, Interactive 3D Distance Field Computation Using Linear Factorization, Proceedings of the 2006 Symposium on Interactive 3D Graphics and Games (I3D '06), pp.117-124, 2006.
DOI : 10.1145/1111411.1111432

A. Sud, N. Govindaraju, and D. Manocha, Interactive computation of discrete generalized voronoi diagrams using range culling, Proceedings of the international symposium on Voronoi diagrams in science and engineering, 2005.

A. Sud, M. A. Otaduy, and D. Manocha, DiFi: Fast 3D Distance Field Computation Using Graphics Hardware, The CGAL Project. 2018. CGAL User and Reference Manual, vol.23, pp.557-566, 2004.
DOI : 10.1111/j.1467-8659.2004.00787.x

D. Watson, Computing the n-dimensional Delaunay tessellation with application to Voronoi polytopes, Comput. J, vol.24, pp.167-172, 1981.
DOI : 10.1093/comjnl/24.2.167

URL : https://academic.oup.com/comjnl/article-pdf/24/2/167/967258/240167.pdf

D. M. Simon, V. White, and . Springel, Fitting the universe on a supercomputer, Computing in Science and Engineering, vol.1, pp.36-45, 1999.