Jean-Daniel Boissonnat and Franco P. Preparata. (Reporting all intersection points, generalized segments Line segment intersection)

From Algorithm Wiki
Revision as of 10:36, 15 February 2023 by Admin (talk | contribs) (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")
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
Jump to navigation Jump to search

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

Retrieved from "https://algorithm-wiki.csail.mit.edu/w/index.php?title=Jean-Daniel_Boissonnat_and_Franco_P._Preparata._(Reporting_all_intersection_points,_generalized_segments_Line_segment_intersection)&oldid=44568"