Centroidal Voronoi tessellation
In geometry, a centroidal Voronoi tessellation (CVT) is a special type of Voronoi tessellation in which the generating point of each Voronoi cell is also its centroid (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 for K-means clustering or Quasi-Newton methods like BFGS.
Wikipage redirect
primaryTopic
Centroidal Voronoi tessellation
In geometry, a centroidal Voronoi tessellation (CVT) is a special type of Voronoi tessellation in which the generating point of each Voronoi cell is also its centroid (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 for K-means clustering or Quasi-Newton methods like BFGS.
has abstract
In geometry, a centroidal Voro ...... uasi-Newton methods like BFGS.
@en
幾何学における重心ボロノイ分割(英: centroidal ...... 位置に多くの点が集まるように密度関数を定義して生成している。
@ja
Wikipage page ID
14.087.640
page length (characters) of wiki page
Wikipage revision ID
1.008.487.807
Link from a Wikipage to another Wikipage
align
right
@en
direction
vertical
@en
footer align
center
@en
header
Three centroidal Voronoi tessellations of five points in a square
@en
header align
center
@en
image
@en
@en
@en
wikiPageUsesTemplate
hypernym
comment
In geometry, a centroidal Voro ...... uasi-Newton methods like BFGS.
@en
幾何学における重心ボロノイ分割(英: centroidal ...... 位置に多くの点が集まるように密度関数を定義して生成している。
@ja
label
Centroidal Voronoi tessellation
@en
重心ボロノイ分割
@ja