News for hackers. Stuff that matters.
Re:A practical use for space-filling curves by wisty on Saturday February 19, 2011 @08:25AM (#2238966)
Are you the author, or connect with the author?

If so, remember that HN readers tend to be a lot more critical of the article than towards other comments.

Anyway, the article didn't really claim to be the fastest heuristic, just an elegant one with some nice properties. It's O(n log n) - what more do people want? O(n)? O(1)? n log n is almost always fast enough.

Re:A practical use for space-filling curves by Vivtek on Saturday February 19, 2011 @11:03AM (#2239223)
remember that HN readers tend to be

user: RiderOfGiraffes created: 822 days ago karma: 18098