A. , P. Cohen-steiner, D. Yvinec, M. And-desbrun, and M. , Variational tetrahedral meshing, Proceeding of SIGGRAPH 2005), pp.617-625, 2005.
URL : https://hal.archives-ouvertes.fr/inria-00226418

A. , P. , C. De-verdi-`-ereverdi-`-verdi-`-ere, ´. E. Devillers, O. And-isenburg et al., Centroidal Voronoi diagrams for isotropic surface remeshing, Graphical Models, vol.67, issue.3, pp.204-231, 2003.

A. , D. And, and S. Vassilvitskii, k-means++: the advantages of careful seeding, Proceedings of the eighteenth annual ACM- SIAM symposium on Discrete algorithms, pp.1027-103, 2007.

C. B. Barber, D. P. Dobkin, and H. And-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

C. , D. Alliez, P. And-desbrun, and M. , Variational shape approximation, ACM Transactions on Graphics, vol.23, issue.3, pp.905-914, 2004.
URL : https://hal.archives-ouvertes.fr/inria-00070632

C. , J. Mart´inezmart´inez, S. And-bullo, and F. , Spatially-distributed coverage optimization and control with limited-range interactions . ESAIM: Control, Optimisation and Calculus of Variations 11, pp.691-719, 2005.

D. , Q. And, and M. Emelianenko, Acceleration schemes for computing centroidal Voronoi tessellations, Numerical Linear Algebra with Applications, vol.13, pp.2-3, 2006.

D. , Q. Emelianenko, M. And-ju, and L. , Convergence of the Lloyd algorithm for computing centroidal Voronoi tessellations, SIAM J. NUMBER. ANAL, vol.44, issue.1, pp.102-119, 2006.

D. , Q. Faber, V. And-gunzburger, and M. , Centroidal Voronoi tessellations: applications and algorithms, SIAM Review, vol.41, issue.4, pp.637-676, 1999.

D. , Q. And, and M. Gunzburger, Grid generation and optimization based on centroidal Voronoi tessellations, Applied Mathematics and Computation, vol.133, pp.2-3, 2002.

D. , Q. Gunzburger, M. D. And-ju, and L. , Constrained centroidal Voronoi tesselations for surfaces, SIAM J. SCI. COMPUT, vol.24, issue.5, pp.1488-1506, 2003.

D. , Q. Wang, and D. , Tetrahedral mesh generation and optimization based on centroidal Voronoi tessellations, International Journal for Numerical Methods in Engineering, vol.56, issue.9, pp.1355-1373, 2003.

D. , Q. Wang, and D. , Anisotropic centroidal Voronoi tessellations and their applications, SIAM J. Sci. Comput, vol.26, issue.3, pp.737-761, 2005.

D. , Q. Wang, and D. , The optimal centroidal Voronoi tessellations and the Gersho's conjecture in the three-dimensional space, Computers and Mathematics with Applications, vol.49, pp.9-10, 2005.

D. , Q. Wang, and X. , Centroidal Voronoi tessellation based algorithms for vector fields visualization and segmentation, IEEE Visualization Proceedings of the conference on Visualization '04, pp.43-50, 2004.

G. , A. And-cools, and R. , An adaptive numerical cubature algorithm for simplices, ACM Trans. Math. Softw, vol.29, issue.3, pp.297-308, 2003.

I. , M. Murota, K. And-ohya, and T. , A fast Voronoi-diagram algorithm with applications to geographical optimization problems, Proceedings of the 11th IFIP Conference, pp.273-288, 1984.

J. , L. Byrd, R. H. Eskow, E. And-schnabel, and R. B. , A preconditioned L-BFGS algorithm with application to molecular energy minimization, 2004.

J. , L. Du, Q. And-gunzburger, and M. , Probabilistic methods for centroidal Voronoi tessellations and their parallel implementations, Parallel Comput, vol.28, issue.10, pp.1477-1500, 2002.

K. , R. Wolter, F. And-rausch, and T. , Geodesic Voronoi diagrams on parametric surfaces, Computer Graphics International Proceedings, pp.230-237, 1997.

L. , G. And-letscher, and D. , Delaunay triangulations and Voronoi diagrams for Riemannian manifolds, SCG '00: Proceedings of the sixteenth annual Symposium on Computational Geometry, pp.341-349, 2000.

L. , C. And-morémor´moré, and J. J. , Incomplete Cholesky factorizations with limited memory, SIAM J. Sci. Comput, vol.21, issue.1, pp.24-45, 1999.

L. , D. C. And-nocedal, and J. , On the limited memory BFGS method for large scale optimization, Mathematical Programming: Series A and B, vol.45, issue.3, pp.503-528, 1989.

M. , A. Lombeyda, S. V. And-desbrun, and M. , Vector field analysis and visualization through variational clustering, Proceedings of EuroVis, pp.29-35, 2005.

M. , J. J. And-thuente, and D. J. , Line search algorithms with guaranteed sufficient decrease, ACM Trans. Math. Softw, vol.20, issue.3, pp.286-307, 1994.

O. , R. Rabani, Y. Schulman, L. J. And-swamy, and C. , The effectiveness of Lloyd-type methods for the k-means problem, 47th Annual IEEE Symposium on Foundations of Computer Science (FOCS'06, pp.165-176, 2006.

P. , G. And, and L. Cohen, Surface segmentation using geodesic centroidal tesselation, 2nd International Symposium on 3D Data Processing, Visualization and Transmission, pp.995-1002, 2004.

S. , R. B. And-eskow, and E. , A revised modified Cholesky factorization algorithm, SIAM J. on Optimization, vol.9, issue.4, pp.1135-1148, 1999.

V. , S. And-chassery, and J. , Approximated centroidal Voronoi diagrams for uniform polygonal mesh coarsening, Computer Graphics ForumEurographics, vol.23, issue.3, pp.381-389, 2004.

V. , S. Chassery, J. And-prost, and R. , Generic remeshing of 3D triangular meshes with metric-dependent discrete Voronoi diagrams, IEEE Transactions on Visualization and Computer Graphics, vol.14, issue.2, pp.369-381, 2008.
URL : https://hal.archives-ouvertes.fr/hal-00537025

Y. , D. Evy, B. Liu, Y. Sun, F. And-wang et al., Isotropic remeshing with fast and exact computation of restricted Voronoi diagram, Computer Graphics Forum (special issue of ACM/EG Symposium on Geometry Processing), vol.28, issue.5, pp.1145-1154, 2009.