Solution of the discrete Plateau problem.
basic_science · Level V
Where this comes from
- Record sourced from PubMed, PMID 11607330.
- Also identified by PMC identifier 50100.
- No licence information is recorded for this record.
- Because redistribution is not established, this page shows the abstract only. Follow the links below for the full text.
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.