2015
DOI: 10.1137/14096061x
|View full text |Cite
|
Sign up to set email alerts
|

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 ene… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

1
59
0
2

Year Published

2016
2016
2023
2023

Publication Types

Select...
7
1

Relationship

1
7

Authors

Journals

citations
Cited by 38 publications
(62 citation statements)
references
References 31 publications
1
59
0
2
Order By: Relevance
“…This strategy is implemented in, e.g. [18,16,14,3,4,5]. The asymptotic equivalence between the approximate variational problem and (1.1) follows from the (expected) Γ-convergence of the family {M ε h } towards M h as ε ↓ 0.…”
Section: Motivationmentioning
confidence: 99%
See 1 more Smart Citation
“…This strategy is implemented in, e.g. [18,16,14,3,4,5]. The asymptotic equivalence between the approximate variational problem and (1.1) follows from the (expected) Γ-convergence of the family {M ε h } towards M h as ε ↓ 0.…”
Section: Motivationmentioning
confidence: 99%
“…In fact the result stated in [8] assumes that T is compactly supported but the general case can be recovered easily. 3 Setting P = P 1 + P ′ 1 , U = U 1 + U ′ 1 and V = V 1 + V ′ 1 , we have T = P + U + ∂V with the estimates…”
Section: Proof Of Theorem 18mentioning
confidence: 99%
“…For instance, in [24] the authors propose an approximation to the branched transport problem based on the Modica-Mortola functional in which the phase field is replaced by a vector-valued function satisfying a divergence constraint. Similarly, in [5] Santambrogio et al study a variational approximation to the Steiner minimal tree problem in which the connectedness constraint of the graph is enforced trough the introduction of a geodesic distance depending on the phase field. Our phase field approximations can be viewed as a generalization of recent work by two of the authors [11,12], in which essentially (1) for τ (m) = αm + β with α, β > 0 is approximated by an Ambrosio-Tortorelli-type functional defined as [σ, ϕ] = ∞ otherwise.…”
Section: Related Workmentioning
confidence: 99%
“…To incorporate a connectedness constraint, we follow an idea developed by two of the authors for a problem of surfaces in a three-dimensional ambient space [8] based on a similar model for the two-dimensional Steiner problem and related questions [4]. Due to its novelty, we include a heuristic motivation here.…”
Section: 2mentioning
confidence: 99%