Content deleted Content added
m Adding local short description: "Algorithm used for points in euclidean space", overriding Wikidata description "method for creating geometric centroidal tessellations from points" |
Link suggestions feature: 3 links added. |
||
| (One intermediate revision by one other user not shown) | |||
Line 60:
** Trivially, a set of [[Tetrahedron|tetrahedra]] is obtained by connecting triangles of the cell's hull with the cell's site.
Integration of a cell and computation of its [[centroid]] ([[center of mass]]) is now given as a weighted combination of its simplices' centroids (in the following called <math display="inline">\mathbf{c}_i</math>).
* Two dimensions:
** For a triangle the centroid can be easily computed, e.g. using [[Centroid#By geometric decomposition|cartesian coordinates]].
Line 83:
==Applications==
Lloyd's method was originally used for scalar quantization, but it is clear that the method extends for [[vector quantization]] as well. As such, it is extensively used in [[data compression]] techniques in [[information theory]]. Lloyd's method is used in computer graphics because the resulting distribution has [[blue noise]] characteristics (see also [[Colors of noise]]), meaning there are few low-frequency components that could be interpreted as artifacts. It is particularly well-suited to picking sample positions for [[dithering]]. Lloyd's algorithm is also used to generate dot drawings in the style of [[stippling]].<ref name="dhos00"/> In this application, the centroids can be weighted based on a reference image to produce stipple illustrations matching an input image.<ref name="s02"/>
In the [[finite element method]], an input ___domain with a [[complex geometry]] is partitioned into elements with simpler shapes; for instance, two-dimensional domains (either subsets of the Euclidean plane or surfaces in three dimensions) are often partitioned into triangles. It is important for the convergence of the finite element methods that these elements be well shaped; in the case of triangles, often elements that are nearly equilateral triangles are preferred. Lloyd's algorithm
can be used to smooth a mesh generated by some other algorithm, moving its vertices and changing the connection pattern among its elements in order to produce triangles that are more closely equilateral.<ref name="dg02"/> These applications typically use a smaller number of iterations of Lloyd's algorithm, stopping it to convergence, in order to preserve other features of the mesh such as differences in element size in different parts of the mesh. In contrast to a different smoothing method, [[Laplacian smoothing]] (in which mesh vertices are moved to the average of their neighbors' positions), Lloyd's algorithm can change the topology of the mesh, leading to more nearly equilateral elements as well as avoiding the problems with tangling that can arise with Laplacian smoothing. However, Laplacian smoothing can be applied more generally to meshes with non-triangular elements.
Line 123:
| pages = 13–22
| title = Proc. 7th International Symposium on Voronoi Diagrams in Science and Engineering (ISVD 2010)
| year = 2010| isbn = 978-1-4244-7606-0 | s2cid = 15971504 }}.</ref>
<ref name="dej06">{{citation
| last1 = Du | first1 = Qiang | author1-link = Qiang Du
Line 192:
| publisher = [[ACM SIGGRAPH]]
| title = Proceedings of the Symposium on Non-Photorealistic Animation and Rendering (NPAR)
| year = 2002|
| s2cid = 12153589
}}.</ref>
<ref name="h01">{{citation
Line 201 ⟶ 202:
| pages = 573–580
| contribution = Simulating decorative mosaics
| year = 2001|
| s2cid = 7188986
}}.</ref>
<ref name="m60">{{citation
| |||