An optimal-time algorithm for slope selection

Given $n$ points in the plane and an integer $k$, the problem of selecting that pair of points that determines the line with the $k$th smallest or largest slope is considered. In the restricted case, where $k$ is $O(n)$, line sweeping gives an optimal, $O(n\log n)$-time algorithm. For general $k$ th...

Celý popis