Serial Simulation of Ceramic Grain Growth Based on Ternary-Tree Structure and Space Partition


Article Preview

An improved serial computation method is proposed for simulating ceramic grain growth at an atomic scale. The data structure of a ternary tree is used to store orderly the atomic information and speed up the editing of data. Combining with the idea of space partition, an index for space searching is established to reduce the computation time. Simulation results demonstrate that the speed of the serial computation is increased significantly and simulated images are in good agreement with micrographs of practical ceramics. It is illustrated that kinetic exponents and fractal dimensions during the simulation of grain growth are also reasonable in compare with quantitative analyses.



Key Engineering Materials (Volumes 336-338)

Edited by:

Wei Pan and Jianghong Gong






G. L. Ji et al., "Serial Simulation of Ceramic Grain Growth Based on Ternary-Tree Structure and Space Partition", Key Engineering Materials, Vols. 336-338, pp. 2536-2539, 2007

Online since:

April 2007




[1] R.L. Kurse, A.J. Ryba: Data Structures and Program Design in C++, 2nd edition (Higher Education Press, Beijing 2001).

[2] Z.X. Xiong, G.L. Ji, X. Fang: Mater. Sci. Eng. Vol. B99, (2003), p.541.

[3] G.L. Ji, Z.X. Xiong, X. Fang, et al.: Parallel Computation for Moving Boundaries in Ceramic Grain Growth. Computational Modelling of Free and Moving Boundary Problems. WIT press (2001), p.13.

In order to see related information, you need to Login.