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