Issue |
EPL
Volume 96, Number 3, November 2011
|
|
---|---|---|
Article Number | 38003 | |
Number of page(s) | 5 | |
Section | Interdisciplinary Physics and Related Areas of Science and Technology | |
DOI | https://doi.org/10.1209/0295-5075/96/38003 | |
Published online | 14 October 2011 |
Topology-dependent description of grain growth
1
School of Materials Science and Engineering, University of Science and Technology Beijing - 100083 Beijing, PRC
2
State Key Laboratory for Advanced Metals and Materials, University of Science and Technology Beijing 100083 Beijing, PRC
3
College of Materials Science and Engineering, Key Laboratory of Advanced Functional Materials, Ministry of Education of China, Beijing University of Technology - Beijing 100124, PRC
Received:
22
July
2011
Accepted:
9
September
2011
A growth equation for individual grains is suggested by considering the interactions of the nearest-neighbor grains, which indicates that the average grain growth rate of a given topological class depends on the difference between the number of faces and the average number of faces of the nearest neighbors. For the convenience of its application, a practical equation is also proposed. They have been verified by the data of β-titanium grains, dry 3D foams, Monte Carlo Potts model simulation, vertex model simulation, and surface evolver simulation.
PACS: 81.10.Jt – Growth from solid phases (including multiphase diffusion and recrystallization) / 61.82.Bg – Metals and alloys / 81.10.Aj – Theory and models of crystal growth; physics and chemistry of crystal growth, crystal morphology, and orientation
© EPLA, 2011
Current usage metrics show cumulative count of Article Views (full-text article views including HTML views, PDF and ePub downloads, according to the available data) and Abstracts Views on Vision4Press platform.
Data correspond to usage on the plateform after 2015. The current usage metrics is available 48-96 hours after online publication and is updated daily on week days.
Initial download of the metrics may take a while.