Boissonnat; Snoeyink (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/citation.cfm?id=304991) == Description == == Approximate? == Exact == Randomized? == No, deterministic == Model of Computation == Real RAM, under more restrictions/considerations? (predicate arithmetic) == Year == 1999 == Reference == https://dl.acm.org/citation.cfm?id=304991") |
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 08:34, 10 April 2023
Time Complexity
$O(n \log n + k )$
Space Complexity
$O(n)$ words
(https://dl.acm.org/citation.cfm?id=304991)
Description
Approximate?
Exact
Randomized?
No, deterministic
Model of Computation
Real RAM, under more restrictions/considerations? (predicate arithmetic)
Year
1999