On Centroidal Voronoi Tessellation - Energy Smoothness and Fast Computation.

Yang Liu and Wenping Wang and Bruno Levy and Feng Sun and Dong-Ming Yan. ( 2009 )
in: ACM Transactions Graphics, pages 1-17

Abstract

Centroidal Voronoi tessellation (CVT) is a particular type of Voronoi tessellation that has many applications in computational sciences and engineering, including computer graphics. The prevailing method for computing CVT is Lloyd's method, which has linear convergence and is inefficient in practice. We develop new efficient methods for CVT computation and demonstrate the fast convergence of these methods. Speciffically, we show that the CVT energy function has 2nd order smoothness for convex domains with smooth density, as well as in most situations encountered in optimization. Due to the 2nd order smoothness, it is therefore possible to minimize the CVT energy functions using Newton-like optimization methods and expect fast convergence. We propose a quasi-Newton method to compute CVT and demonstrate its faster convergence than Lloyd's method with various numerical examples. It is also signifficantly faster and more robust than the Lloyd-Newton method, a previous attempt to accelerate CVT. We also demonstrate surface remeshing as a possible application.

Download / Links

BibTeX Reference

@inproceedings{Liu2009,
 abstract = { Centroidal Voronoi tessellation (CVT) is a particular type of Voronoi tessellation that has many applications in computational sciences and engineering, including computer graphics. The prevailing method for computing CVT is Lloyd's method, which has linear convergence and is inefficient in practice. We develop new efficient methods for CVT computation and demonstrate the fast convergence of these methods. Speciffically, we show that the CVT energy function has 2nd order smoothness for convex domains with smooth density, as well as in most situations encountered in optimization. Due to the 2nd order smoothness, it is therefore possible to minimize the CVT energy functions using Newton-like optimization methods and expect fast convergence. We propose a quasi-Newton method to compute CVT and demonstrate its faster convergence than Lloyd's method with various numerical examples. It is also signifficantly faster and more robust than the Lloyd-Newton method, a previous attempt to accelerate CVT. We also demonstrate surface remeshing as a possible application. },
 author = { Liu, Yang AND Wang, Wenping AND Levy, Bruno AND Sun, Feng AND Yan, Dong-Ming },
 booktitle = { ACM Transactions Graphics },
 number = { 28 },
 pages = { 1-17 },
 title = { On Centroidal Voronoi Tessellation - Energy Smoothness and Fast Computation. },
 year = { 2009 }
}