A Discrete Global Minimization Algorithm for Continuous Variational Problems
Danil Kirsanov, Steven J. Gortler · 2004
In this paper, we apply the ideas from combinatorial optimization to find globally optimal solutions to continuous variational problems. At the heart of our method is an algorithm to solve for globally optimal discrete minimal surfaces. This discrete surface problem is a natural generalization of the planar-graph shortest path problem.