F. Faure, B. Gilles, G. Bousquet, and D. K. Pai, Sparse meshless models of complex deformable solids, ACM SIGGRAPH 2011 papers on -SIGGRAPH '11, 2011.
URL : https://hal.archives-ouvertes.fr/inria-00589204

P. Harish, V. Vineet, and P. J. Narayanan, Large Graph Algorithms for Massively Multithreaded Architectures International Institute of Information Technology Hyderabad, 2009.

E. W. Dijkstra, A note on two problems in connexion with graphs, Numerische Mathematik, vol.4, issue.1, pp.269-271, 1959.
DOI : 10.1007/BF01386390

G. Rong, Y. Liu, W. Wang, and X. Yin, GPU-Assisted Computation of Centroidal Voronoi Tessellation, IEEE Transactions on Visualization and Computer Graphics, vol.17, issue.3, pp.345-356, 2011.
DOI : 10.1109/TVCG.2010.53

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

K. E. Hoff, I. , T. Culver, J. Keyser, M. Lin et al., Fast computation of generalized Voronoi diagrams using graphics hardware, Proceedings of the 26th annual conference on Computer graphics and interactive techniques, pp.277-286, 1999.

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 , SI3D '06, p.109, 2006.
DOI : 10.1145/1111411.1111431

M. Erwig, The graph Voronoi diagram with applications, Networks, vol.27, issue.3, pp.156-163, 2000.
DOI : 10.1002/1097-0037(200010)36:3<156::AID-NET2>3.0.CO;2-L

F. Hurtado, R. Klein, E. Langetepe, and V. Sacristán, The weighted farthest color Voronoi diagram on trees and graphs, Computational Geometry, vol.27, issue.1, pp.13-26, 2004.
DOI : 10.1016/j.comgeo.2003.07.003

O. Weber, Y. S. Devir, A. M. Bronstein, M. M. Bronstein, and R. Kimmel, Parallel algorithms for approximation of distance maps on parametric surfaces, ACM Transactions on Graphics, vol.27, issue.4, pp.1-16, 2008.
DOI : 10.1145/1409625.1409626

D. Reem, On the possibility of simple parallel computing of Voronoi diagrams and Delaunay graphs, pp.1-31, 1212.

A. Crauser, K. Mehlhorn, U. Meyer, and P. Sanders, A parallelization of Dijkstra's shortest path algorithm, Mathematical Foundations of Computer Science, pp.722-731, 1998.
DOI : 10.1007/BFb0055823

S. Kumar, A. Misra, and R. S. Tomar, A modified parallel approach to Single Source Shortest Path Problem for massively dense graphs using CUDA, 2011 2nd International Conference on Computer and Communication Technology (ICCCT-2011), pp.635-639, 2011.
DOI : 10.1109/ICCCT.2011.6075214

R. Nasre, M. Burtscher, and K. Pingali, Atomic-free irregular computations on GPUs, Proceedings of the 6th Workshop on General Purpose Processor Using Graphics Processing Units, GPGPU-6, pp.96-107, 2013.
DOI : 10.1145/2458523.2458533

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

K. Madduri, D. Bader, J. Berry, and J. Crobak, Parallel shortest path algorithms for solving large-scale instances, " in 9th DIMACS Implementation Challenge ? The Shortest Path Problem, DIMACS Center, pp.1-39, 2006.

H. Ortega-arranz, Y. Torres, D. R. Llanos, and A. Gonzalez-escribano, A new GPU-based approach to the Shortest Path problem, 2013 International Conference on High Performance Computing & Simulation (HPCS), pp.505-511, 2013.
DOI : 10.1109/HPCSim.2013.6641461

J. Hoberock, V. Lu, Y. Jia, and J. Hart, Stream compaction for deferred shading, Proceedings of the 1st ACM conference on High Performance Graphics, HPG '09, pp.173-180, 2009.
DOI : 10.1145/1572769.1572797

N. Bell and J. Hoberock, THRUST: a productivity-oriented library for CUDA, GPU Computing Gems, vol.7, 2011.
DOI : 10.1016/B978-0-12-811986-0.00033-9

P. Sofa, Simulation open framework architecture, 2014.

F. Faure, C. Duriez, H. Delingette, J. Allard, B. Gilles et al., SOFA: A Multi-Model Framework for Interactive Physical Simulation, 2012.
DOI : 10.1007/8415_2012_125

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