Solution of the discrete Plateau problem.
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.
Hu
T C
TC
Department of Computer Science and Engineering, University of California at San Diego, La Jolla, CA 92093-0114, USA.
Kahng
A B
AB
Robins
G
G