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.
[ Parent
| on HN ]
There are no comments on this comment yet.