Laplacian smoothing: Difference between revisions
No edit summary |
No edit summary Tag: references removed |
||
| Line 7: | Line 7: | ||
<math>x_{i}= \frac{1}{N} \sum_{j=0}^{N}x_j </math> |
<math>x_{i}= \frac{1}{N} \sum_{j=0}^{N}x_j </math> |
||
Where <math>N</math> is the number of adjacent vertices to node <math>i</math>< |
Where <math>N</math> is the number of adjacent vertices to node <math>i</math> <cite>[[#Glen05|Glen et. al. 2005]]</cite>. |
||
==External links== |
==External links== |
||
Revision as of 21:09, 8 April 2009
 | This article has multiple issues. Please help improve it or discuss these issues on the talk page. (Learn how and when to remove these template messages)
No issues specified. Please specify issues, or remove this template. |
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.
More formally, the smoothing operation may be described per-vertex as:
Where is the number of adjacent vertices to node Glen et. al. 2005.
External links
References
Hansen, Glen A.; Douglass, R.W; Zardecki, Andrew (2005). Mesh enhancement. Imperial College Press. p. 404.
 | This geometry-related article is a stub. You can help Wikipedia by expanding it. |