Expected number of alignments in a uniform random distribution

This paper provides equations for the expected numbers of k-point lines (here defined as narrow rectangular boxes of a given length and width) that are likely to be found in a wider square domain containing a uniform distribution of points. Satisfactory agreement with a detailed simulation has been demonstrated. This provides some basis for assessing the likelihood that linear measurement sequences formed by a tracker in a cluttered environment could have occurred randomly.