论文信息 - Computing Discrete Minimal Surfaces Using a Nonlinear Spring Model

Computing Discrete Minimal Surfaces Using a Nonlinear Spring Model

A new algorithm can derive one or more minimal surfaces from an initial arbitrary surface with a fixed boundary. A discrete surface is a mesh represented as a set of vertices in 3D. The method extends earlier work, which used linear elastic springs to simulate a spider web animated in 3D.

[1] Jim X. Chen,et al. Physics-based modeling and real-time simulation , 2001, Comput. Sci. Eng..

[2] L. G. Jaeger,et al. Dynamics of structures , 1990 .

[3] Mark Meyer,et al. Discrete Differential-Geometry Operators for Triangulated 2-Manifolds , 2002, VisMath.

[4] Tibor Rado,et al. On Plateau's Problem , 1930 .

[5] Ulrich Pinkall,et al. Computing Discrete Minimal Surfaces and Their Conjugates , 1993, Exp. Math..

[6] D. Chopp. Computing Minimal Surfaces via Level Set Curvature Flow , 1993 .

[7] Gerhard Dziuk,et al. The discrete Plateau Problem: Algorithm and numerics , 1999, Math. Comput..

[8] Richard Courant,et al. Plateau’s Problem , 1950 .

[9] J. Douglas. Solution of the problem of Plateau , 1931 .

[10] Takuya Tsuchiya,et al. On two methods for approximating minimal surfaces in parametric form , 1986 .

[11] W. L. Wilson. On discrete Dirichlet and plateau problems , 1961 .

[12] Thomas C. Cecil,et al. A numerical method for computing minimal surfaces in arbitrary dimension , 2005 .