Computing minimal surfaces via level set curvature flow (Q2365911): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
Import241208061232 (talk | contribs)
Normalize DOI.
 
(5 intermediate revisions by 4 users not shown)
Property / DOI
 
Property / DOI: 10.1006/jcph.1993.1092 / rank
Normal rank
 
Property / author
 
Property / author: Q829037 / rank
Normal rank
 
Property / reviewed by
 
Property / reviewed by: Rudolf Wegmann / rank
Normal rank
 
Property / author
 
Property / author: David L. Chopp / rank
 
Normal rank
Property / reviewed by
 
Property / reviewed by: Rudolf Wegmann / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2116737017 / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1006/JCPH.1993.1092 / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 05:41, 18 December 2024

scientific article
Language Label Description Also known as
English
Computing minimal surfaces via level set curvature flow
scientific article

    Statements

    Computing minimal surfaces via level set curvature flow (English)
    0 references
    29 June 1993
    0 references
    A new method is presented for solving numerically Plateau's problem of constructing a minimal surface with a prescribed boundary curve. The surface is represented as a level set of a global real function \(\Phi\) in \(\mathbb{R}^ 3\). The function \(\Phi\) depends additionally on a parameter \(t\) and evolves according to mean curvature flow until a steady state is reached. The surface is attached to the fixed boundary curve by interpolatory conditions. The basic algorithm as well as procedures to avoid collapse near the boundary and to make the algorithm fast, are described in detail. The topology of the level set of \(\Phi\) can change easily during the iteration. This offers the opportunity to determine the topological type of the minimal surface automatically. This is a big advantage over existing methods which are either incapable or require ad hoc intervention to change topology. A series of fourteen calculated minimal surfaces shown in grey scale pictures demonstrate the wide applicability of the algorithm as well as the beauty of minimal surfaces.
    0 references
    numerical examples
    0 references
    Plateau's problem
    0 references
    minimal surface
    0 references
    prescribed boundary curve
    0 references
    algorithm
    0 references
    0 references

    Identifiers