Chazelle & Edelsbrunner (Reporting all intersection points, line 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( nlog n + k )$ == Space Complexity == $O(n+k)$ total? words (https://dl.acm.org/doi/10.1145/147508.147511) == Description == == Approximate? == Exact == Randomized? == No, deterministic == Model of Computation == Real RAM == Year == 1992 == Reference == https://dl.acm.org/doi/10.1145/147508.147511")
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
Jump to navigation Jump to search

Time Complexity

$O( nlog n + k )$

Space Complexity

$O(n+k)$ total? words

(https://dl.acm.org/doi/10.1145/147508.147511)

Description

Approximate?

Exact

Randomized?

No, deterministic

Model of Computation

Real RAM

Year

1992

Reference

https://dl.acm.org/doi/10.1145/147508.147511

Retrieved from "https://algorithm-wiki.csail.mit.edu/w/index.php?title=Chazelle_%26_Edelsbrunner_(Reporting_all_intersection_points,_line_segments_Line_segment_intersection)&oldid=44565"