Bentley–Ottmann algorithm (Reporting all intersection points, line segments Line segment intersection): Difference between revisions
Jump to navigation
Jump to search
(Created page with "== Time Complexity == $O( n log n + k log n)$ == Space Complexity == $O(n)$ auxiliary words (https://dl.acm.org/doi/pdf/10.1145/147508.147511) == Description == == Approximate? == Exact == Randomized? == No, deterministic == Model of Computation == Real RAM == Year == 1979 == Reference == https://doi.org/10.1109%2FTC.1979.1675432") |
No edit summary |
||
| Line 1: | Line 1: | ||
== Time Complexity == | == Time Complexity == | ||
$O( n log n + k log n)$ | $O( n \log n + k \log n)$ | ||
== Space Complexity == | == Space Complexity == | ||
$O(n)$ | $O(n)$ words | ||
(https://dl.acm.org/doi/pdf/10.1145/147508.147511) | (https://dl.acm.org/doi/pdf/10.1145/147508.147511) | ||
Latest revision as of 08:53, 10 April 2023
Time Complexity
$O( n \log n + k \log n)$
Space Complexity
$O(n)$ words
(https://dl.acm.org/doi/pdf/10.1145/147508.147511)
Description
Approximate?
Exact
Randomized?
No, deterministic
Model of Computation
Real RAM
Year
1979