Hostname: page-component-7b7567c8c-wxvwp Total loading time: 0 Render date: 2026-11-13T22:49:11.368Z Has data issue: false hasContentIssue false

An Algorithm For Exhaustive Heteroepitaxial Substrate Searches

Published online by Cambridge University Press:  25 February 2011

Paul J. Shlichta*
Affiliation:
Crystal Research, 9112 Tucker Road SE, Olympia, WA 98503-8904, USA.
Get access

Abstract

An algorithm has been discovered that greatly simplifies the exhaustive search for all orientations of all known crystals that have a lattice match with crystal film to be epitaxially deposited. It is based on the observations that (1) a two-dimensional lattice match of necessity entails an integer-ratio match between the areas of the unit parallelograms of the substrate and deposit planes and (2) that the unit area A (hkl) is equal to the unit cell volume divided by d(hkl). Using this algorithm, we are currently verifying the area-match tolerances for known cases of epitaxy and developing database-generating and searchprogram software.

Information

Type
Research Article
Copyright
Copyright © Materials Research Society 1991

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)

Article purchase

Temporarily unavailable