Hacker News new | ask | show | jobs
by SuperFine 1280 days ago
The end result is still O(n^2) in the number of vertices in the convex hull...

If you didn't just slap together JS libs, but studied the literature, you'd find that the proper algorithm for this problem runs in O(n) time, and is called the "rotating calipers" algorithm.

2 comments

And even that isn't going to work correctly in all cases if you just ignore the Earth's curvature.
Damn way to be a condescending dickhead.
Please don't respond to a bad comment by breaking the site guidelines yourself. That only makes everything worse.

https://news.ycombinator.com/newsguidelines.html

Edit: it looks like you've been breaking the site guidelines in other places as well. We ban accounts that do that repeatedly, so please don't.

Please consider editing out the D-word from your comment.

Some religious folks might find it a bit offensive. Thank you! (some alternatives: dang, darn, gosh, blimey, golly, etc.)

We've banned this account for posting unsubstantive and flamebait comments.

Please don't create accounts to break HN's rules with. If you don't want to be banned, you're welcome to email hn@ycombinator.com and give us reason to believe that you'll follow them in the future. They're here: https://news.ycombinator.com/newsguidelines.html.

Why specifically mention religious folks?

Some specific religion that adheres to the church of the throbbing Cock, and want us not to take the Holy Dickhead into our mouths in vain?

A condescending gollyhead? I think that might be worse.
Damn way to be a condescending blimey?