Approximation of length minimization problems among compact connected sets

Abstract

In this paper we provide an approximation à la Ambrosio-Tortorelli of some classical minimization problems involving the length of an unknown one-dimensional set, with an additional connectedness constraint, in dimension two. We introduce a term of new type relying on a weighted geodesic distance that forces the minimizers to be connected at the limit. We apply this approach to approximate the so-called Steiner Problem, but also the average distance problem, and finally a problem relying on the p-compliance energy. The proof of convergence of the approximating functional, which is stated in terms of Gamma-convergence relies on technical tools from geometric measure theory, as for instance a uniform lower bound for a sort of average directional Minkowski content of a family of compact connected sets.

Cited by in corpus (14)

• Phase field models for thin elastic structures with topological constraint
• A simple phase-field approximation of the Steiner problem in dimension two
• Learning phase field mean curvature flows with neural networks
• A convex approach to the Gilbert-Steiner problem
• Variational approximation of size-mass energies for k-dimensional currents
• Regularity for the planar optimal p-compliance problem
• Connected Coulomb Columns: Analysis and Numerics
• Approximation of the relaxed perimeter functional under a connectedness constraint by phase-fields
• Partial regularity for the optimal $p$-compliance problem with length penalization
• A Modica-Mortola approximation for the Steiner Problem
• Improved stability of optimal traffic paths
• A penalized Allen-Cahn equation for the mean curvature flow of thin structures
• Variational approximation of functionals defined on $1$-dimensional connected sets in ${\mathbb{R}}^n$
• On the well-posedness of branched transportation