Fine Art


Laplacian smoothing is an algorithm to smooth a polygonal mesh.[1][2] For each vertex in a mesh, a new position is chosen based on local information (such as the position of neighbors) 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 neighbors) then this operation produces the Laplacian of the mesh.

More formally, the smoothing operation may be described per-vertex as:

\( \bar{x}_{i}= \frac{1}{N} \sum_{j=1}^{N}\bar{x}_j \)

Where N is the number of adjacent vertices to node i and \(\bar{x}_{i} \) is the new position for node i.[3]
See also

Tutte embedding, an embedding of a planar mesh in which each vertex is already at the average of its neighbors' positions


Herrmann, Leonard R. (1976), "Laplacian-isoparametric grid generation scheme", Journal of the Engineering Mechanics Division 102 (5): 749–756.
Sorkine, O., Cohen-Or, D., Lipman, Y., Alexa, M., R\"{o}ssl, C., Seidel, H.-P. (2004). "Laplacian Surface Editing". Proceedings of the 2004 Eurographics/ACM SIGGRAPH Symposium on Geometry Processing. SGP '04. Nice, France: ACM. pp. 175–184. doi:10.1145/1057432.1057456. ISBN 3-905673-13-4. Retrieved 1 December, 2013. Check date values in: |accessdate= (help)
Hansen, Glen A.; Douglass, R. W; Zardecki, Andrew (2005). Mesh enhancement. Imperial College Press. p. 404.

Undergraduate Texts in Mathematics

Graduate Texts in Mathematics

Graduate Studies in Mathematics

Mathematics Encyclopedia

Retrieved from ""
All text is available under the terms of the GNU Free Documentation License

Home - Hellenica World