For a list of n 2d points, finding the convex hull vertex takes O(n log(n)) time. And O(n) time if it’s sorted lexicon order.
Meanwhile What’s the complexity of finding the histogram bin edges of k bins on both axis ?
Which one is faster ?
100% Private Proxies – Fast, Anonymous, Quality, Unlimited USA Private Proxy!
Get your private proxies now!
For a list of n 2d points, finding the convex hull vertex takes O(n log(n)) time. And O(n) time if it’s sorted lexicon order.
Meanwhile What’s the complexity of finding the histogram bin edges of k bins on both axis ?
Which one is faster ?