Laplacian smoothing

From Wikipedia, the free encyclopedia

This article or section has multiple issues. Please help improve the article or discuss these issues on the talk page. It needs additional references or sources for verification. Tagged since December 2007. It needs to be expanded. Tagged since December 2007.

Laplacian smoothing is an algorithm to smooth a polygonal mesh. 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.

[edit] External links

• http://www.andrew.cmu.edu/user/sowen/abstracts/Fi464.html