
We study the evolution of grain boundary networks by the mean-curvature flow under the restriction that the networks are Voronoi diagrams for a set of points. For such evolution we prove a rigorous universal upper bound on the coarsening rate. The rate agrees with the rate predicted for the evolution by mean-curvature flow of the general grain boundary networks, namely that the typical grain area grows linearly in time. We perform a numerical simulation which provides evidence that the dynamics achieves the rate of coarsening that agrees with the upper bound in terms of scaling.
Analysis of microstructure in solids, grain boundary networks, coarsening rate, Voronoi diagrams, Numerical aspects of computer graphics, image analysis, and computational geometry, FOS: Mathematics, 19999 Mathematical Sciences not elsewhere classified, mean-curvature flow, network of curves, Geometric evolution equations (mean curvature flow, Ricci flow, etc.)
Analysis of microstructure in solids, grain boundary networks, coarsening rate, Voronoi diagrams, Numerical aspects of computer graphics, image analysis, and computational geometry, FOS: Mathematics, 19999 Mathematical Sciences not elsewhere classified, mean-curvature flow, network of curves, Geometric evolution equations (mean curvature flow, Ricci flow, etc.)
| selected citations These citations are derived from selected sources. This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically). | 4 | |
| popularity This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network. | Average | |
| influence This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically). | Average | |
| impulse This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network. | Average |
