The algorithm assume general position of the input, namely no more than two points on the same line.
There is a function checking that this is the case, but its not always enabled, as it runs in O(n^3).
We can check it in O(n^2) using duality, and run the function always, without damaging the O(n^2 log n) runtime