Bentley–Ottmann algorithm (Reporting all intersection points, line segments Line segment intersection)

From Algorithm Wiki

Revision as of 10:32, 15 February 2023 by Admin (talk | contribs) (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")

(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)$ 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

Retrieved from "https://algorithm-wiki.csail.mit.edu/w/index.php?title=Bentley–Ottmann_algorithm_(Reporting_all_intersection_points,_line_segments_Line_segment_intersection)&oldid=44414"