Discrete anisotropic curvature flow of graphs
Discrete anisotropic curvature flow of graphs
The evolution of n–dimensional graphs under a weighted curvature flow is approximated by linear finite elements. We obtain optimal error bounds for the normals and the normal velocities of the surfaces in natural norms. Furthermore we prove a global existence result for the continuous problem and present some examples of computed surfaces.