News for hackers. Stuff that matters.
Re:Why Are Geospatial Databases So Hard to Build? by joe_the_user on Sunday March 15, 2015 @09:25PM (#9209160)
Do you really think polygon intersection is inherently quadratic? It seems plausible to me that there are more efficient algorithms out there.

See my comment: https://news.ycombinator.com/item?id=9208066

Re:Why Are Geospatial Databases So Hard to Build? by me2i81 on Monday March 16, 2015 @12:05AM (#9209783)
The lower bound for computing the points of intersection is n log n + k for n line segments and k intersections, but obviously k can be n^2 in the worst case.