Centroidal Voronoi tessellation
From Wikipedia, the free encyclopedia
In geometry, a centroidal Voronoi tessellation (CVT) is a special type of Voronoi tessellation or Voronoi diagrams. A Voronoi tessellation is called centroidal when the generating point of each Voronoi cell is also its mean (center of mass). It can be viewed as an optimal partition corresponding to an optimal distribution of generators. A number of algorithms can be used to generate centroidal Voronoi tessellations, including Lloyd's algorithm and the K-means algorithm.
Centroidal Voronoi tessellations are useful in data compression, optimal quadrature, optimal quantization, clustering, and optimal mesh generation. [1]
[edit] References
- ^ Qiang Du, Vance Faber, and Max Gunzburger, Centroidal Voronoi Tesselations: Applications and Algorihms, SIAM Review, 41, no. 4, pp. 637-676, 1999.
