Journal of Scientific Computing

, Volume 63, Issue 1, pp 185–212 | Cite as

Fast Methods for Computing Centroidal Voronoi Tessellations

  • James C. Hateley
  • Huayi Wei
  • Long ChenEmail author


A Centroidal Voronoi tessellation (CVT) is a Voronoi tessellation in which the generators are the centroids for each Voronoi region. CVTs have many applications to computer graphics, image processing, data compression, mesh generation, and optimal quantization. Lloyd’s method, the most widely method used to generate CVTs, converges very slowly for larger scale problems. Recently quasi-Newton methods using the Hessian of the associated energy as a preconditioner are developed to speed up the rate of convergence. In this work a graph Laplacian preconditioner and a two-grid method are used to speed up quasi-Newton schemes. The proposed graph Laplacian is always symmetric, positive definite and easy to assemble, while the Hessian, in general, may not be positive definite nor easy to assemble. The two-grid method, in which an optimization method using a relaxed stopping criteria is applied on a coarse grid, and then the coarse grid is refined to generate a better initial guess in the fine grid, will further speed up the convergence and lower the energy. Numerical tests show that our preconditioned two-grid optimization methods converges fast and has nearly linear complexity.


Centroidal Voronoi tessellation Lloyd’s method Numerical optimization Quasi-Newton methods 

Mathematics Subject Classification

62H30 65H10 65K10 65U05 68U10 


  1. 1.
    Benzi, M., Tůma, M.: A comparative study of sparse approximate inverse preconditioners. Appl. Numer. Math. 30, 305–340 (1999)CrossRefzbMATHMathSciNetGoogle Scholar
  2. 2.
    Brandt, A.: Algebraic multigrid theory: the symmetric case. Appl. Math. Comput. 19(1–4), 23–56 (1986)CrossRefzbMATHMathSciNetGoogle Scholar
  3. 3.
    Chen, L.: \(i\)FEM: An Integrated Finite Element Methods Package in MATLAB. Technical Report, UC IrvineGoogle Scholar
  4. 4.
    Chen, L., Holst, M.: Efficient mesh optimization schemes based on optimal Delaunay triangulations. Comput. Methods Appl. Mech. Eng. 200, 967–984 (2011)CrossRefzbMATHMathSciNetGoogle Scholar
  5. 5.
    Chen, L., Xu, J.: Optimal Delaunay triangulations. J. Comput. Math. 22(2), 299–308 (2004)zbMATHMathSciNetGoogle Scholar
  6. 6.
    Du, Q., Emelianenko, M.: Acceleration schemes for computing centroidal Voronoi tessellations. Numer. Linear Algebra 13(2–3), 173–192 (2006)CrossRefzbMATHMathSciNetGoogle Scholar
  7. 7.
    Du, Q., Emelianenko, M.: Uniform convergence of a nonlinear energy-based multilevel quantization scheme. SIAM J. Numer. Anal. 46(3), 1483–1502 (2008)CrossRefzbMATHMathSciNetGoogle Scholar
  8. 8.
    Du, Q., Emelianenko, M., Ju, L.: Convergence of the Lloyd algorithm for computing centroidal Voronoi tessellations. SIAM J. Numer. Anal. 44(1), 102–119 (2006)CrossRefzbMATHMathSciNetGoogle Scholar
  9. 9.
    Du, Q., Faber, V., Gunzburger, M.: Centroidal voronoi tessellations: applications and algorithms. SIAM Rev. 41(4), 637–676 (1999)CrossRefzbMATHMathSciNetGoogle Scholar
  10. 10.
    Du, Q., Gunzburger, M.: Grid generation and optimization based on centroidal Voronoi tessellations. Appl. Math. Comput. 133, 591–607 (2002)CrossRefzbMATHMathSciNetGoogle Scholar
  11. 11.
    Du, Q., Gunzburger, M., Ju, L.: Advances in studies and applications of centroidal Voronoi tessellations. Numer. Math. Theor. Methods Appl. 3(2), 119–142 (2010)zbMATHMathSciNetGoogle Scholar
  12. 12.
    Du, Q., Gunzburger, M., Ju, L., Wang, X.: Centroidal Voronoi tessellation algorithms for image compression, segmentation, and multichannel restoration. J. Math. Imaging Vis. 24, 177–194 (2006)CrossRefMathSciNetGoogle Scholar
  13. 13.
    Emelianenko, M.: Fast multilevel CVT-based adaptive data visualization algorithm. Numer. Math. Theor. Methods Appl. 3, 195–211 (2010)zbMATHMathSciNetGoogle Scholar
  14. 14.
    Emelianenko, M., Ju, L., Rand, A.: Nondegeneracy and weak global convergence of the Lloyd algorithm in \(\mathbb{R}^d\). SIAM J. Numer. Anal. 46(3), 1423–1441 (2008)CrossRefzbMATHMathSciNetGoogle Scholar
  15. 15.
    Fabri, A., Giezeman, G., Kettner, L., Schirra, S., Schönherr, S., et al.: On the design of CGAL, the computational geometry algorithms library (1998)Google Scholar
  16. 16.
    Fejes Tóth, G.: A stability criterion to the moment theorem. Stud. Sci. Math. Hung. 38(1), 209–224 (2001)zbMATHGoogle Scholar
  17. 17.
    Fletcher, R., Reeves, C.M.: Function minimization by conjugate gradients. Comput. J. 7(2), 149–154 (1964)CrossRefzbMATHMathSciNetGoogle Scholar
  18. 18.
    Gersho, A.: Asymptotically optimal block quantization. IEEE Trans. Inf. Theory 25(4), 373–380 (1979)CrossRefzbMATHMathSciNetGoogle Scholar
  19. 19.
    Gray, R.M., Neuhoff, D.L.: Quantization. IEEE Trans. Inf. Theory 44, 2325–2384 (1998)CrossRefzbMATHMathSciNetGoogle Scholar
  20. 20.
    Gruber, P.M.: Optimum quantization and its applications. Adv. Math. 186(2), 456–497 (2004)CrossRefzbMATHMathSciNetGoogle Scholar
  21. 21.
    Hager, W.W., Zhang, H.: A survey of nonlinear conjugate gradient methods. Pac. J. Optim. 2(1), 35–58 (2006)zbMATHMathSciNetGoogle Scholar
  22. 22.
    Hestenes, M.R., Stiefel, E.: Methods of Conjugate Gradients for Solving Linear Systems (1952)Google Scholar
  23. 23.
    Koren, Y., Yavneh, I.: Adaptive multiscale redistribution for vector quantization. SIAM J. Sci. Comput. 27(5), 1573–1593 (2006)CrossRefzbMATHMathSciNetGoogle Scholar
  24. 24.
    Koren, Y., Yavneh, I., Spira, A.: A multigrid approach to the scalar quantization problem. IEEE Trans. Inform. Theory 51(8), 2993–2998 (2005)CrossRefzbMATHMathSciNetGoogle Scholar
  25. 25.
    Lin, C., Moré, J.J.: Incomplete cholesky factorizations with limited memory. SIAM J. Sci. Comput. 21(1), 24–45 (1999)CrossRefzbMATHMathSciNetGoogle Scholar
  26. 26.
    Liu, D.C., Nocedal, J.: On the limited memory BFGS method for large scale optimization. Math. Program. 45, 503–528 (1989)CrossRefzbMATHMathSciNetGoogle Scholar
  27. 27.
    Liu, Y., Wang, W., Lévy, B., Sun, F., Yan, D., Lu, L., Yang, C.: On centroidal Voronoi tessellation—energy smoothness and fast computation. ACM Trans. Graph. 28, 101:1–101:17 (2009)Google Scholar
  28. 28.
    Livne, O., Brandt, A.: Lean algebraic multigrid (LAMG): fast graph Laplacian linear solver. ArXiv e-prints (2011)Google Scholar
  29. 29.
    Lloyd, S.: Least squares quantization in PCM. IEEE Trans. Inform. Theory 28(2), 129–137 (1982)CrossRefzbMATHMathSciNetGoogle Scholar
  30. 30.
    Nguyen, H., Burkardt, J., Gunzburger, M., Ju, L., Saka, Y.: Constrained CVT meshes and a comparison of triangular mesh generators. Comput. Geom. 42(1), 1–19 (2009)CrossRefzbMATHMathSciNetGoogle Scholar
  31. 31.
    Nocedal, J., Wright, S.J.: Numerical Optimization. Springer, Berlin (1999)CrossRefzbMATHGoogle Scholar
  32. 32.
    Polak, E., Ribiere, G.: Note sur la convergence de méthodes de directions conjuguées. Revue. Fr. Inf. Rech. Oper. 3(1), 35–43 (1969)zbMATHMathSciNetGoogle Scholar
  33. 33.
    Ruge, J.W., Stüben, K.: Algebraic multigrid (AMG). In: McCormick, S.F. (ed.) Multigrid Methods, Frontiers in Applied Mathematics, vol. 3, pp. 73–130. SIAM, Philadelphia, PA (1987)CrossRefGoogle Scholar
  34. 34.
    Wang, D., Du, Q.: Mesh optimization based on the centroidal voronoi tessellation. Int. J. Numer. Anal. Model. 2, 100–113 (2005)MathSciNetGoogle Scholar
  35. 35.
    Xu, J.: Two-grid discretization techniques for linear and nonlinear PDEs. SIAM J. Numer. Anal. 33(5), 1759–1777 (1996)CrossRefzbMATHMathSciNetGoogle Scholar
  36. 36.
    Xu, J.: Fast Poisson-based solvers for linear and nonlinear PDEs. In: Proceedings of the International Congress of Mathematics, vol. 4, pp. 2886–2912. (2010)Google Scholar
  37. 37.
    Zhang, J., Emelianenko, M., Du, Q.: Periodic centroidal Voronoi tessellations. IJNAM 9(4), 950–969 (2012)zbMATHMathSciNetGoogle Scholar
  38. 38.
    Zimmer, H.: Voronoi and Delaunay techniques. In: Proceedings of Lecture Notes, Computer Sciences, vol. 8. (2005)Google Scholar

Copyright information

© Springer Science+Business Media New York 2014

Authors and Affiliations

  1. 1.IrvineUSA
  2. 2.Hunan Key Laboratory for Computation and Simulation in Science and Engineering, School of Mathematics and Computational ScienceXiangtan UinversityXiangtanPeople’s Republic of China
  3. 3.Department of MathematicsUniversity of California, IrvineIrvineUSA

Personalised recommendations