期刊名称：Proceedings of the National Academy of Sciences
印刷版ISSN：0027-8424
电子版ISSN：1091-6490
出版年度：1992
卷号：89
期号：19
页码：9235-9236
DOI：10.1073/pnas.89.19.9235
语种：English
出版社：The National Academy of Sciences of the United States of America
摘要：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.
