Calculating the grain boundary inclination of voxelated grain structures using a smoothing algorithm

• Published in: Scripta materialia Vol. 218; p. 114796
• Main Authors: Yang, Lin, Hilty, Floyd, Muralikrishnan, Vivekanand, Silva-Reyes, Kenneth, Harley, Joel B., Krause, Amanda R., Tonks, Michael R.
• Format: Journal Article
• Language: English
• Published: United States Elsevier Ltd 01.09.2022; Elsevier
• Subjects: 3D Reconstruction; Grain boundary structure; MATERIALS SCIENCE; Smoothing algorithm; 3D Reconstruction; 0000; 1111; Grain boundary structure; Smoothing algorithm
• ISSN: 1359-6462; 1872-8456
• DOI: 10.1016/j.scriptamat.2022.114796

[Display omitted] We have developed a flexible method for calculating the grain boundary (GB) inclinations of voxelated grain structure data using smoothing algorithms. We compared the performance of four algorithms: the linear interpolation, Allen–Cahn, level-set, and vertex algorithms. We assessed their accuracy using 2D and 3D cases with known inclinations. The vertex algorithm provided the best balance between accuracy and efficiency for 2D structures while the linear interpolation algorithm provided the best balance for 3D structures. We compared the GB inclinations calculated using our smoothing method on a 3D high energy X-ray diffraction microscopy (HEDM) dataset to those determined by meshing the GBs. The two approaches determined similar GB plane distributions, though they varied significantly at triple junctions. Finally, the smoothing method was demonstrated for two sources of 3D voxelated grain structures: HEDM data and results from Monte Carlo Potts grain growth simulations.