Computational study of the Willmore flow on graphs
Finite difference scheme for the Willmore flow of graphs
In this article we discuss numerical scheme for the approximation of the Willmore flow of graphs. The scheme is based on the finite difference method. We improve the scheme we presented in Oberhuber [Obe-2005-2,Obe-2005-1] which is based on combination of the forward and the backward finite differences. The new scheme approximates the Willmore flow by the central differences and as a result it better preserves symmetry of the solution. Since it requires higher regularity of the solution, additional...
The CUDA implementation of the method of lines for the curvature dependent flows
We study the use of a GPU for the numerical approximation of the curvature dependent flows of graphs - the mean-curvature flow and the Willmore flow. Both problems are often applied in image processing where fast solvers are required. We approximate these problems using the complementary finite volume method combined with the method of lines. We obtain a system of ordinary differential equations which we solve by the Runge-Kutta-Merson solver. It is a robust solver with an automatic choice of the...
Page 1