The unit-cell reduction described by Selling and used by Delone (whose early publications were under the spelling Delaunay) is explained in a simple form. The transformations needed to implement the reduction are listed. The simplicity of this reduction contrasts with the complexity of Niggli reduction.

The transformations from the primitive cells of the centered Bravais lattices to the corresponding centered cells have conventionally been listed as three-by-three matrices that transform three-space lattice vectors. Using those three-by-three matrices when working in the six-dimensional space of lattices represented as Selling scalars as used in Delone (Delaunay) reduction, one could transform to the three-space representation, apply the three-by-three matrices and then back-transform to the six-space representation, but it is much simpler to have the equivalent six-by-six matrices and apply them directly. The general form of the transformation from the three-space matrix to the corresponding matrix operating on Selling scalars (expressed in space S⁶) is derived, and the particular S⁶matrices for the centered Delone types are listed. (Note: in his later publications, Boris Delaunay used the Russian version of his surname, Delone.).

A method is proposed for choosing unit cells for a group of crystals so that they all appear as nearly similar as possible to a selected cell. Related unit cells with varying cell parameters or indexed with different lattice centering can be accommodated.

Algorithms for quantifying the differences between two lattices are used for Bravais lattice determination, database lookup for unit cells to select candidates for molecular replacement, and recently for clustering to group together images from serial crystallography. It is particularly desirable for the differences between lattices to be computed as a perturbation-stable metric, i.e. as distances that satisfy the triangle inequality, so that standard tree-based nearest-neighbor algorithms can be used, and for which small changes in the lattices involved produce small changes in the distances computed. A perturbation-stable metric space related to the reduction algorithm of Selling and to the Bravais lattice determination methods of Delone is described. Two ways of representing the space, as six-dimensional real vectors or equivalently as three-dimensional complex vectors, are presented and applications of these metrics are discussed. (Note: in his later publications, Boris Delaunay used the Russian version of his surname, Delone.).

In macromolecular crystallography, higher flux, smaller beams, and faster detectors open the door to experiments with very large numbers of very small samples that can reveal polymorphs and dynamics but require re-engineering of approaches to the clustering of images both at synchrotrons and XFELs (X-ray free electron lasers). The need for the management of orders of magnitude more images and limitations of file systems favor a transition from simple one-file-per-image systems such as CBF to image container systems such as HDF5. This further increases the load on computers and networks and requires a re-examination of the presentation of metadata. In this paper, we discuss three important components of this problem-improved approaches to the clustering of images to better support experiments on polymorphs and dynamics, recent and upcoming changes in metadata for Eiger images, and software to rapidly validate images in the revised Eiger format.