to irregular connectivity triangle meshes. This is accomplished through the design of a non-
uniform relaxation procedure whose weights depend on the geometry and we show its
superiority over existing schemes whose weights depend only on connectivity. This is
combined with known mesh simplification methods to build subdivision and pyramid
algorithms. We demonstrate the power of these algorithms through a number of application …