enow.com Web Search

Search results

  1. Results from the WOW.Com Content Network
  2. Unit cell - Wikipedia

    en.wikipedia.org/wiki/Unit_cell

    A primitive cell is a unit cell that contains exactly one lattice point. For unit cells generally, lattice points that are shared by n cells are counted as ⁠ 1 / n ⁠ of the lattice points contained in each of those cells; so for example a primitive unit cell in three dimensions which has lattice points only at its eight vertices is considered to contain ⁠ 1 / 8 ⁠ of each of them. [3]

  3. Fractional coordinates - Wikipedia

    en.wikipedia.org/wiki/Fractional_coordinates

    Instead, it is chosen so the number of orthogonal basis vectors is maximized. This results in some of the coefficients of the equations above being fractional. A lattice in which the conventional basis is primitive is called a primitive lattice, while a lattice with a non-primitive conventional basis is called a centered lattice.

  4. Oblique lattice - Wikipedia

    en.wikipedia.org/wiki/Oblique_lattice

    The oblique lattice is one of the five two-dimensional Bravais lattice types. [1] The symmetry category of the lattice is wallpaper group p2. The primitive translation vectors of the oblique lattice form an angle other than 90° and are of unequal lengths.

  5. Bravais lattice - Wikipedia

    en.wikipedia.org/wiki/Bravais_lattice

    If the lattice or crystal is 2-dimensional, the primitive cell has a minimum area; likewise in 3 dimensions the primitive cell has a minimum volume. Despite this rigid minimum-size requirement, there is not one unique choice of primitive unit cell. In fact, all cells whose borders are primitive translation vectors will be primitive unit cells.

  6. Hexagonal lattice - Wikipedia

    en.wikipedia.org/wiki/Hexagonal_lattice

    Vectors and are primitive translation vectors. The honeycomb point set is a special case of the hexagonal lattice with a two-atom basis. [ 1 ] The centers of the hexagons of a honeycomb form a hexagonal lattice, and the honeycomb point set can be seen as the union of two offset hexagonal lattices.

  7. Rectangular lattice - Wikipedia

    en.wikipedia.org/wiki/Rectangular_lattice

    The rectangular lattice and rhombic lattice (or centered rectangular lattice) constitute two of the five two-dimensional Bravais lattice types. [1] The symmetry categories of these lattices are wallpaper groups pmm and cmm respectively. The conventional translation vectors of the rectangular lattices form an angle of 90° and are of unequal ...

  8. Reciprocal lattice - Wikipedia

    en.wikipedia.org/wiki/Reciprocal_lattice

    Reciprocal space (also called k-space) provides a way to visualize the results of the Fourier transform of a spatial function. It is similar in role to the frequency domain arising from the Fourier transform of a time dependent function; reciprocal space is a space over which the Fourier transform of a spatial function is represented at spatial frequencies or wavevectors of plane waves of the ...

  9. Kabsch algorithm - Wikipedia

    en.wikipedia.org/wiki/Kabsch_algorithm

    Let P and Q be two sets, each containing N points in .We want to find the transformation from Q to P.For simplicity, we will consider the three-dimensional case (=).The sets P and Q can each be represented by N × 3 matrices with the first row containing the coordinates of the first point, the second row containing the coordinates of the second point, and so on, as shown in this matrix: