An efficient algorithm for computing the primitive bases of a general lattice plane. (1st April 2015)

• Record Type: Journal Article
• Authors: Banadaki, Arash D.; Patala, Srikanth
• Is Part Of: Journal of applied crystallography. Volume 48:Part 2(2015:Apr.)
• Page Start: 585
• Page End: 588
• Publication Date: 2015-04-01
• Subjects: Crystallography -- Periodicals; 548.05
• DOI: 10.1107/S1600576715004446
• Languages: English
• ISSNs: 0021-8898

Abstract

<abstract abstract-type="main" xml:lang="en"> <title> <x xml:space="preserve">Abstract</x> </title> <p>The atomistic structures of interfaces and their properties are profoundly influenced by the underlying crystallographic symmetries. Whereas the theory of bicrystallography helps in understanding the symmetries of interfaces, an efficient methodology for computing the primitive basis vectors of the two‐dimensional lattice of an interface does not exist. In this article, an algorithm for computing the basis vectors for a plane with Miller indices (<italic>hkl</italic>) in an arbitrary lattice system is presented. This technique is expected to become a routine tool for both computational and experimental analysis of interface structures.</p> </abstract>