Jean-Daniel Boissonnat and Franco P. Preparata. (Reporting all intersection points, generalized 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)$ words (https://epubs.siam.org/doi/epdf/10.1137/S0097539797329373) == Description == == Approximate? == Exact == Randomized? == No, deterministic == Model of Computation == Real RAM, under more restrictions/considerations? (predicate arithmetic, exact arithmetic) == Year == 1997 == Reference == https://epubs.siam.org/doi/abs/10.1137/S0097539797329373") |
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 == | ||
Latest revision as of 08:34, 10 April 2023
Time Complexity
$O(n \log n + k \log n)$
Space Complexity
$O(n)$ words
(https://epubs.siam.org/doi/epdf/10.1137/S0097539797329373)
Description
Approximate?
Exact
Randomized?
No, deterministic
Model of Computation
Real RAM, under more restrictions/considerations? (predicate arithmetic, exact arithmetic)
Year
1997