Goodrich (Reporting all intersection points, line segments Line segment intersection)
Jump to navigation
Jump to search
Time Complexity
$O(\log^{2}(n))$
Space Complexity
$O(n+k)$ total? words
(Seems to require creating/storing an O(n)-sized data structure ("segment tree"), and then computing the O(k) intersections using the data structure)
Description
Approximate?
Exact
Randomized?
No, deterministic
Model of Computation
CREW PRAM
Year
1989