Numerical approximation of the Steiner problem in dimension $2$ and $3$
From MaRDI portal
Publication:5235091
DOI10.1090/mcom/3442zbMath1447.65055OpenAlexW2899703448MaRDI QIDQ5235091
Matthieu Bonnivard, Antoine Lemenant, Elie Bretin
Publication date: 7 October 2019
Published in: Mathematics of Computation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1090/mcom/3442
Variational problems in a geometric measure-theoretic setting (49Q20) Steiner systems in finite geometry (51E10) Methods involving semicontinuity and convergence; relaxation (49J45) Stability and convergence of numerical methods for initial value and initial-boundary value problems involving PDEs (65M12)
Related Items (3)
A convex approach to the Gilbert-Steiner problem ⋮ Variational approximation of functionals defined on \(1\)-dimensional connected sets in \(\mathbb{R}^n\) ⋮ Learning phase field mean curvature flows with neural networks
Cites Work
- Unnamed Item
- Unnamed Item
- Derivatives with respect to metrics and applications: subgradient marching algorithm
- Generation and propagation of interfaces for reaction-diffusion equations
- Applications of semi-implicit Fourier-spectral method to phase field equations
- On a phase field approximation of the planar Steiner problem: existence, regularity, and asymptotic of minimizers
- A phase-field approximation of the Steiner problem in dimension two
- Existence and regularity results for the Steiner problem
- A Modica-Mortola approximation for the Steiner problem
- Iterated local search algorithms for the Euclidean Steiner tree problem inndimensions
- Second-order Convex Splitting Schemes for Gradient Flows with Ehrlich–Schwoebel Type Energy: Application to Thin Film Epitaxy
- Second-Order Edge-Penalization in the Ambrosio--Tortorelli functional
- Fast Marching Methods
- Second Order Singular Perturbation Models for Phase Transitions
- Variational Approximation of Functionals Defined on 1-dimensional Connected Sets: The Planar Case
- Reducibility among Combinatorial Problems
- Approximation of Length Minimization Problems Among Compact Connected Sets
- Research problems
This page was built for publication: Numerical approximation of the Steiner problem in dimension $2$ and $3$
