Balaban. (Reporting all intersection points, generalized segments Line segment intersection): Difference between revisions
Jump to navigation
Jump to search
(Created page with "== Time Complexity == $O( nlog n + k )$ == Space Complexity == $O(n)$ words (https://dl.acm.org/doi/pdf/10.1145/220279.220302) == Description == == Approximate? == Exact == Randomized? == No, deterministic == Model of Computation == Real RAM == Year == 1995 == Reference == https://dl.acm.org/doi/pdf/10.1145/220279.220302") |
No edit summary |
||
| Line 1: | Line 1: | ||
== Time Complexity == | == Time Complexity == | ||
$O( | $O(n \log n + k )$ | ||
== Space Complexity == | == Space Complexity == | ||
Latest revision as of 09:34, 10 April 2023
Time Complexity
$O(n \log n + k )$
Space Complexity
$O(n)$ words
(https://dl.acm.org/doi/pdf/10.1145/220279.220302)
Description
Approximate?
Exact
Randomized?
No, deterministic
Model of Computation
Real RAM
Year
1995