Corpus ID: 119304525

Keeping it together: a phase field version of path-connectedness and its implementation

@article{Dondl2018KeepingIT,
  title={Keeping it together: a phase field version of path-connectedness and its implementation},
  author={P. Dondl and Stephan Wojtowytsch},
  journal={arXiv: Numerical Analysis},
  year={2018}
}
We describe the implementation of a topological constraint in finite element simulations of phase field models which ensures path-connectedness of preimages of intervals in the phase field variable. Two main applications of our method are presented. First, a discrete steepest decent of a phase field version of a bending energy with spontaneous curvature and additional surface area penalty is shown, which leads to disconnected surfaces without our topological constraint but connected surfaces… Expand

Figures and Tables from this paper

Approximation of the relaxed perimeter functional under a connectedness constraint by phase-fields
We develop a phase-field approximation of the relaxation of the perimeter functional in the plane under a connectedness constraint based on the classical Modica-Mortola functional and theExpand
A phase-field approach to variational hierarchical surface segmentation
In this paper, we propose a phase-field model to partition a curved surface into path-connected segments with minimal boundary length. Phase-fields offer a powerful tool to represent diffuseExpand
Connected Coulomb columns: analysis and numerics
We consider a version of Gamow’s liquid drop model with a short range attractive perimeter-penalizing potential and a long-range Coulomb interaction of a uniformly charged mass in R3 . Here weExpand

References

SHOWING 1-10 OF 12 REFERENCES
Phase Field Models for Thin Elastic Structures with Topological Constraint
This article is concerned with the problem of minimising the Willmore energy in the class of connected surfaces with prescribed area which are confined to a small container. We propose a phase fieldExpand
Approximation of Length Minimization Problems Among Compact Connected Sets
TLDR
This paper provides an approximation of some classical minimization problems involving the length of an unknown one-dimensional set, with an additional connectedness constraint, in dimension two, and introduces a term of new type relying on a weighted geodesic distance that forces the minimizers to be connected at the limit. Expand
Derivatives with respect to metrics and applications: subgradient marching algorithm
TLDR
A subgradient descent algorithm to compute a Riemannian metric that minimizes an energy involving geodesic distances and shows applications to landscape modeling and to traffic congestion. Expand
Uniform regularity and convergence of phase-fields for Willmore’s energy
We investigate the convergence of phase fields for the Willmore problem away from the support of a limiting measure $$\mu $$μ. For this purpose, we introduce a suitable notion of essentially uniformExpand
Simulating the deformation of vesicle membranes under elastic bending energy in three dimensions
TLDR
This paper studies the three-dimensional deformation of a vesicle membrane under the elastic bending energy, with prescribed bulk volume and surface area, with a newly developed energetic variational formulation. Expand
On a Modified Conjecture of De Giorgi
We study the Γ-convergence of functionals arising in the Van der Waals–Cahn–Hilliard theory of phase transitions. Their limit is given as the sum of the area and the Willmore functional. The problemExpand
Corners Give Problems When Decoupling Fourth Order Equations Into Second Order Systems
TLDR
This note compares both settings for the plate equation and proves that for planar domains with corners the system approach may fail to produce the correct solution. Expand
A note on two problems in connexion with graphs
  • E. Dijkstra
  • Mathematics, Computer Science
  • Numerische Mathematik
  • 1959
TLDR
A tree is a graph with one and only one path between every two nodes, where at least one path exists between any two nodes and the length of each branch is given. Expand
A mixed finite element method for the biharmonic equation
We consider the mixed finite element approximation of the biharmonic problem on a smooth domain with either clamped or simply supported boundary conditions. Error estimates are proved for theExpand
Approximation of Helfrich's Functional via Diffuse Interfaces
We give a rigorous proof of the approximability of the so-called Helfrich's functional via diffuse interfaces under a constraint on the ratio between the bending rigidity and the Gaussian rigidity.
...
1
2
...