Content deleted Content added
Open access status updates in citations with OAbot #oabot |
m Adding local short description: "Algorithm used for points in euclidean space", overriding Wikidata description "method for creating geometric centroidal tessellations from points" |
||
Line 1:
{{Short description|Algorithm used for points in euclidean space}}
In [[electrical engineering]] and [[computer science]], '''Lloyd's algorithm''', also known as '''Voronoi iteration''' or relaxation, is an algorithm named after Stuart P. Lloyd for finding evenly spaced sets of points in subsets of [[Euclidean space]]s and partitions of these subsets into well-shaped and uniformly sized convex cells.<ref name="l82"/> Like the closely related [[k-means clustering|''k''-means clustering]] algorithm, it repeatedly finds the [[centroid]] of each set in the partition and then re-partitions the input according to which of these centroids is closest. In this setting, the mean operation is an integral over a region of space, and the nearest centroid operation results in [[Voronoi diagram]]s.
| |||