An Algorithm for the Even Distribution of Entities in One Dimension
Audrey Compton · The Computer Journal · 1985
A general algorithm is proposed for distributing n entities as evenly as possible among N spaces. A definition of evenness is suggested in terms of the Discrete Fourier Transform (DFT) of the distribution, which is justified empirically using examples. The definition could be used to compare approximations to optimum evenness, which may be easier to use in real-time than is the algorithm.