Hacker News new | ask | show | jobs
by pfdietz 199 days ago
You can also cover every one of the points "with high probability" in O(N log N) time (meaning: the chance you missed any point is at most 1/p(N) for a polynomial p, with the constant in the big-O depending on p.)