Solution of the discrete Plateau problem.
T. C. Hu, Andrew B. Kahng, Garry L. Robins · Proceedings of the National Academy of Sciences · 1992
We solve a discrete version of the classic Plateau problem, which asks for a minimal surface spanning a given curve. Our algorithm is based on a network-flow formulation that finds minimal slabs, intuitively corresponding to minimal "surfaces" of prescribed thickness. We let the slab thickness approach zero in order to obtain the desired minimal surface.