1. CONVERGENCE OF THE LLOYD ALGORITHM FOR COMPUTING CENTROIDAL VORONOI TESSELLATIONS.
- Author
-
Qiang Du, Emelianenko, Maria, and Lili Ju
- Subjects
- *
TESSELLATIONS (Mathematics) , *VORONOI polygons , *STOCHASTIC convergence , *ALGORITHMS , *NUMERICAL analysis , *GEOMETRY - Abstract
Centroidal Voronoi tessellations (CVTs) are Voronoi tessellations of a bounded geometric domain such that the generating points of the tessellations are also the centroids (mass centers) of the corresponding Voronoi regions with respect to a given density function. Centroidal Voronoi tessellations may also be defined in more abstract and more general settings. Due to the natural optimization properties enjoyed by CVTs, they have many applications in diverse fields. The Lloyd algorithm is one of the most popular iterative schemes for computing the CVTs but its theoretical analysis is far from complete. In this paper, some new analytical results on the local and global convergence of the Lloyd algorithm are presented. These results are derived through careful utilization of the optimization properties shared by CVTs. Numerical experiments are also provided to substantiate the theoretical analysis. [ABSTRACT FROM AUTHOR]
- Published
- 2006
- Full Text
- View/download PDF