A lattice parallelepiped is a parallelepiped spanned by three linearly independent lattice vectors. If the vectors are a primitive basis of a Bravais lattice, translates of the corresponding half-open parallelepiped tile space without overlap, with one lattice point per cell under consistent boundary counting.
Its volume is . Choosing longer lattice vectors can instead produce a nonprimitive cell containing several lattice points; integer coordinates of its vertices alone do not prove primitiveness. The primitive version is useful for counting states and relating real-space volume to the volume of a reciprocal lattice cell.
A lattice cube is a cube whose vertices belong to a specified lattice. Its three edge vectors are mutually perpendicular lattice vectors of equal length. In the simple cubic lattice , an axis-aligned cube of side is a primitive unit cell.
Larger cubes can have lattice vertices while enclosing many primitive cells, so “lattice cube” is a geometric condition rather than a synonym for primitive cell. For a cube of side in that example, its volume is times the primitive-cell volume. Consistent shared-boundary counting assigns one lattice point to the side- cell, even though eight corner points are visible in a closed drawing.
For a simple polygon whose vertices are lattice points in , its area is , where counts interior lattice points and counts boundary lattice points.
Articles by others on the same topic
There are currently no matching articles.