Centroidal Voronoi tessellation
id:
centroidal-voronoi-tessellation-195-7631063
title:
Centroidal Voronoi tessellation
text:
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. 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.
brand slug:
wiki
category slug:
encyclopedia
description:
Voronoi tessellation where the generating point of each Voronoi cell is also its centroid
original url:
https://en.wikipedia.org/wiki/Centroidal_Voronoi_tessellation
date created:
date modified:
2024-01-15T10:59:09Z
main entity:
{"identifier":"Q5062961","url":"https://www.wikidata.org/entity/Q5062961"}
image:
{"content_url":"https://upload.wikimedia.org/wikipedia/commons/5/50/CentroidalVoronoiTessellation1.png","width":560,"height":420}
fields total:
13
integrity:
15