
Voronoi tessellation was known a long time ago. A centroidal Voronoi tessellation (CVT) is a special type of Voronoi tessellation that the Voronoi points (generators) are mass centers of the corresponding Voronoi regions. This brings the optimization properties to CVT and the properties can be applied to problems of image compression, optimal quadrature rules, etc. This paper is concerned with the methods of finding CVT. First, some properties and theoretical results of CVT are shown. Since it is difficult to find the CVT theoretically in general, k-means method and Lloyd method will be introduced so that we can find the CVT numerically. The efficiency and the accuracy of both methods will be compared.
Voronoi polygons, Tessellation (Mathematics)
Voronoi polygons, Tessellation (Mathematics)
| selected citations These citations are derived from selected sources. This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically). | 0 | |
| popularity This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network. | Average | |
| influence This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically). | Average | |
| impulse This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network. | Average |
