We describe a new algorithm that solves classical geometric problem: Find surface of minimal area bordered by an arbitrarily prescribed boundary curve. Existing numerical methods face challenges due to the non-convexity problem. Using representation curves and surfaces via differential forms on ambient space, we reformulate this problem as convex optimization. This change variables overcomes ma...