An $O(n\log n)$ algorithm for finding a $k$-point subset with minimal $L_\infty$-diameter