Hacker News new | past | comments | ask | show | jobs | submit login
Laplacian Mesh Smoothing by Throwing Vertices (nosferalatu.com)
42 points by nosferalatu123 3 months ago | hide | past | favorite | 10 comments



Isn't this a fancy name for just iteratively moving a vertex towards the center of mass of its connected vertices?


At 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


It’s a shorter name for that.


It sounds like it doesn't have any guarantees regarding topology. Or maybe it's so simple or does?

Let's be positive my friends


I 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.


(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.


Truly fancy name would be something like, "Laplacian smoothing via gravitational accretion of vertetesimals"?


Which is a fancy name for a low-pass filter?


This reminds me of bouncing on a trampoline. I'm a human not a computer


Funny 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!




Consider applying for YC's Fall 2025 batch! Applications are open till Aug 4

Guidelines | FAQ | Lists | API | Security | Legal | Apply to YC | Contact

Search: