Lecture 8: Mesh Representations and Geometry Processing (107)
Sicheng-Pan
I'm wondering if this algorithm always work? Or is there any cases where this algorithm fails to produce better meshes?
modatberkeley
The steps here are simplified, but the referenced paper shows that performing this cycle several times should eventually result in length close to l and valence to 6. But it also mentions that these steps may still produce vertex areas that still differ, and offers a way to approach this by using tangential smoothing. If you're curious, take a look at the paper here! https://www.graphics.rwth-aachen.de/media/papers/remeshing1.pdf
I'm wondering if this algorithm always work? Or is there any cases where this algorithm fails to produce better meshes?
The steps here are simplified, but the referenced paper shows that performing this cycle several times should eventually result in length close to l and valence to 6. But it also mentions that these steps may still produce vertex areas that still differ, and offers a way to approach this by using tangential smoothing. If you're curious, take a look at the paper here! https://www.graphics.rwth-aachen.de/media/papers/remeshing1.pdf