2 ms·
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:
by joe_the_user 12y ago
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 https://news.ycombinator.com/item?id=9208066
- me2i81 12y agoThe 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.