Multigrain indexing of unknown multiphase materials

9Citations
Citations of this article
32Readers
Mendeley users who have this article in their library.

This article is free to access.

Abstract

A multigrain indexing algorithm for use with samples comprising an arbitrary number of known or unknown phases is presented. No a priori crystallographic knowledge is required. The algorithm applies to data acquired with a monochromatic beam and a conventional two-dimensional detector for diffraction. Initially, candidate grains are found by searching for crystallographic planes, using a Dirac comb convoluted with a box function as a filter. Next, candidate grains are validated and the unit cell is optimized. The algorithm is validated by simulations. Simulations of 500 cementite grains and ∼100 reflections per grain resulted in 99.2% of all grains being indexed correctly and 99.5% of the reflections becoming associated with the right grain. Simulations with 200 grains associated with four mineral phases and 50-700 reflections per grain resulted in 99.9% of all grains being indexed correctly and 99.9% of the reflections becoming associated with the right grain. The main limitation is in terms of overlap of diffraction spots and computing time. Potential areas of use include three-dimensional grain mapping, structural solution and refinement studies of complex samples, and studies of dilute phases.

Cite

CITATION STYLE

APA

Wejdemann, C., & Poulsen, H. F. (2016). Multigrain indexing of unknown multiphase materials. Journal of Applied Crystallography, 49, 616–621. https://doi.org/10.1107/S1600576716003691

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free