Computing minimal surfaces with differential forms

We describe a new algorithm that solves a classical geometric problem: Find a surface of minimal area bordered by an arbitrarily prescribed boundary curve. Existing numerical methods face challenges due to the non-convexity of the problem. Using a representation of curves and surfaces via differential forms on the ambient space, we reformulate this problem as a convex optimization. This change of variables overcomes many difficulties in previous numerical attempts and allows us to find the global minimum across all possible surface topologies. The new algorithm is based on differential forms on the ambient space and does not require handling meshes. We adopt the Alternating Direction Method of Multiplier (ADMM) to find global minimal surfaces. The resulting algorithm is simple and efficient: it boils down to an alternation between a Fast Fourier Transform (FFT) and a pointwise shrinkage operation. We also show other applications of our solver in geometry processing such as surface reconstruction.

[1]  Wai Yeung Lam.  Discrete minimal surfaces: critical points of the area functional from integrable systems , 2015, 1510.08788.

[2]  Max Wardetzky,et al.  Variational convergence of discrete minimal surfaces , 2016, Numerische Mathematik.

[3]  Harold R. Parks,et al.  Explicit determination of area minimizing hypersurfaces. II , 1986 .

[4]  Leonidas J. Guibas,et al.  Earth mover's distances on discrete surfaces , 2014, ACM Trans. Graph..

[5]  David Hoffman,et al.  The computer-aided discovery of new embedded minimal surfaces , 1987 .

[6]  Alain Trouvé,et al.  Functional Currents: A New Mathematical Tool to Model and Analyse Functional Shapes , 2012, Journal of Mathematical Imaging and Vision.

[7]  H.-J. Wagner,et al.  A contribution to the numerical approximation of minimal surfaces , 1977, Computing.

[8]  Richard G. Baraniuk,et al.  Fast Alternating Direction Optimization Methods , 2014, SIAM J. Imaging Sci..

[9]  Stephen T Hyde,et al.  Hierarchical self-assembly of a striped gyroid formed by threaded chiral mesoscale networks , 2014, Proceedings of the National Academy of Sciences.

[10]  Masaaki Shimasaki,et al.  Numerical solution of Plateau’s problem by a finite element method , 1974 .

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

[12]  Yiying Tong,et al.  3D hodge decompositions of edge- and face-based vector fields , 2019, ACM Trans. Graph..

[13]  H. Brezis,et al.  The Plateau problem from the perspective of optimal transport , 2019, Comptes Rendus Mathematique.

[14]  Harold R. Parks,et al.  Explicit Determination in $$\mathbb {R} ^{N}$$RN of $$(N-1)$$(N-1)-Dimensional Area Minimizing Surfaces with Arbitrary Boundaries , 2019, The Journal of Geometric Analysis.

[15]  P. Concus.  Numerical solution of the minimal surface equation , 1967 .

[16]  G. Dziuk,et al.  An algorithm for evolutionary surfaces , 1990 .

[17]  Harold R. Parks,et al.  Computing Least Area Hypersurfaces Spanning Arbitrary Boundaries , 1997, SIAM J. Sci. Comput..

[18]  G. Schwarz.  Hodge Decomposition - A Method for Solving Boundary Value Problems , 1995 .

[19]  Tamal K. Dey,et al.  Optimal Homologous Cycles, Total Unimodularity, and Linear Programming , 2011, SIAM J. Comput..

[20]  Wenping Wang,et al.  Flow aligned surfacing of curve networks , 2015, ACM Trans. Graph..

[21]  G. Schröder-Turk,et al.  In a material world: Hyperbolic geometry in biological materials , 2015 .

[22]  Mathieu Desbrun,et al.  A variational approach to Eulerian geometry processing , 2007, SIGGRAPH 2007.

[23]  Michele Emmer,et al.  Minimal Surfaces and Architecture: New Forms , 2013 .

[24]  Moheb Sabry Aziz,et al.  Biomimicry as an approach for bio-inspired structure with the aid of computation , 2016 .

[25]  Yiying Tong,et al.  Stable, circulation-preserving, simplicial fluids , 2007, TOGS.

[26]  G. P. Leonardi,et al.  Discretization and Approximation of Surfaces Using Varifolds , 2018 .

[27]  Keenan Crane,et al.  Optimal cone singularities for conformal flattening , 2018, ACM Trans. Graph..