The number of directions determined by less than \(q\) points (Q1938793)

For a set \(U\) of points in \(\mathrm{AG}(2,q)\) define the set of directions \(D:=\{(b-d)/(a-c); (a,b)\not=(c,d)\}\) as a subset of \(\mathrm{GF}(q)\cup\{\infty\}\). Suppose that \(\infty\in D\). The authors define two parameters \(s\) and \(t\) and prove that one of the following three statements holds: \(1=s\leq t<q\) and \({|U|-1 \over t+1}+2\leq |D|\leq q+1\); or \(1<s\leq t<q\) and \({|U|-1 \over t+1}+2\leq |D|\leq {|U|-1 \over s-1}\); or \(1\leq s\leq t=q\) and \(D=\{\infty\}\). This theorem is similar to a result of \textit{A. Blokhuis} et al. [J. Comb. Theory, Ser. A 86, No. 1, 187--196 (1999; Zbl 0945.51002)]