Six integers that do not depend on the description
The same monoclinic lattice written in 4 different bases, each obtained from the last by an integer matrix of determinant one, and each reduced by Niggli's algorithm. Every one of them gives the same six integers — the squared lengths and twice the dot products of the reduced basis. That is what makes the reduced form a fingerprint of the lattice: two cells with no number in common are the same lattice exactly when their reduced forms agree, and the comparison has no tolerance in it.
2 essays call
niggli. The drawing above is what it returns with no arguments at all; every
call below passes it something, because a placement that passes nothing draws whichever member
of the family the generator happens to default to rather than the one its essay argues about.
Every one of this site's 393 essays names its parameters at the
call site, which the standard pass of 2026-08-09 established and param-floor
holds.
Where it is called
Changing this generator changes every one of these figures.
The cell that settles the argument
Two determinations of one compound can report cells that share no number and describe the same lattice. Reduction is the procedure that decides — six integers that depend on the lattice and not on anybody's choice of axes, and that agree exactly when the lattices do.
A reduction with one rule
Niggli's reduction is eight numbered conditions with sub-cases, applied in order until none applies. Selling's is a single rule on four vectors that sum to zero: while any of six numbers is positive, do one thing. It terminates sooner, its termination is a quantity that visibly falls, and when it stops the six numbers are the Voronoi cell — the pattern of which ones vanish gives Fedorov's five solids and nothing else.