Variational Minimization on String-rearrangement Surfaces, Illustrated by an Analysis of the Bilinear Interpolation
Daud Ahmad, Bilal Masud

TL;DR
This paper introduces a variational algorithm to minimize the surface area spanned by boundary curves, demonstrating its effectiveness on specific surfaces and suggesting bilinear interpolation is nearly minimal.
Contribution
The authors propose a novel variational method that simplifies the minimization of surface area by polynomial approximation of mean curvature, applied to string-rearrangement surfaces.
Findings
Significant area reduction for a hemiellipsoid surface.
Less than 0.8% area decrease for bilinear interpolation.
Bilinear interpolation may be close to the minimal surface.
Abstract
In this paper we present an algorithm to reduce the area of a surface spanned by a finite number of boundary curves by initiating a variational improvement in the surface. The ansatz we suggest consists of original surface plus a variational parameter multiplying the numerator of mean curvature function defined over the surface. We point out that the integral of the square of the mean curvature with respect to the surface parameter becomes a polynomial in this variational parameter. Finding a zero, if there is any, of this polynomial would end up at the same (minimal) surface as obtained by minimizing more complicated area functional itself. We have instead minimized this polynomial. Moreover, our minimization is restricted to a search in the class of all surfaces allowed by our ansatz. All in all, we have not yet obtained the exact minimal but we do reduce the area for the…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
