[1][2] For each vertex in a mesh, a new position is chosen based on local information (such as the position of neighbours) and the vertex is moved there.
In the case that a mesh is topologically a rectangular grid (that is, each internal vertex is connected to four neighbours) then this operation produces the Laplacian of the mesh.
More formally, the smoothing operation may be described per-vertex as: Where
is the number of adjacent vertices to node
This geometry-related article is a stub.