A multigrain indexing algorithm for use with samples comprising an arbitrary number of known or unknown phases is presented. No 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.
Download full-text PDF |
Source |
---|---|
http://www.ncbi.nlm.nih.gov/pmc/articles/PMC4815876 | PMC |
http://dx.doi.org/10.1107/S1600576716003691 | DOI Listing |
Enter search terms and have AI summaries delivered each week - change queries or unsubscribe any time!