4 ms·
Laplacian Mesh Smoothing by Throwing Vertices
- amelius 2y agoIsn't this a fancy name for just iteratively moving a vertex towards the center of mass of its connected vertices?
- nkrisc 2y agoIt’s a shorter name for that.
- gsf_emergency_2 2y agoTruly fancy name would be something like, "Laplacian smoothing via gravitational accretion of vertetesimals"?
- ramblingrain 2y agoIt sounds like it doesn't have any guarantees regarding topology. Or maybe it's so simple or does? Let's be positive my friends
- itishappy 2y agoI don't think the algorithm as presented adds or removes new neighbors, preserving topology (except it won't prevent self-intersections using only neighbor positions). I imagine this is often used with some type of adaptive meshing algorithm for to make something like the clay editing model shown in the Substance demo.
- nosferalatu123 2y ago(author here) That's correct. The algorithm preserves topology because no new vertices or indices are created. It can result in self intersecting meshes, but one way that this can be used is what Substance Modeler does, which is continuously remesh.
- fc417fc802 2y agoAt a glance it seems quite similar to Lloyd Relaxation. All these fancy names for iteratively averaging vertex coordinates. I guess the nuance is going over my head. https://en.wikipedia.org/wiki/Lloyd's_algorithm https://en.wikipedia.org/wiki/Lloyd's_algorithm
- akomtu 2y agoWhich is a fancy name for a low-pass filter?
- ramblingrain 2y agoThis reminds me of bouncing on a trampoline. I'm a human not a computer
- peterdsharpe 2y agoFunny you should mention that! The surface of a trampoline can actually be modeled as a 2nd-order wave equation PDE, which uses a Laplacian spatial kernel - for the same reasons this is called Laplacian smoothing!