Boissonnat; Snoeyink (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( 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")

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

Retrieved from "https://algorithm-wiki.csail.mit.edu/w/index.php?title=Boissonnat;_Snoeyink_(Reporting_all_intersection_points,_generalized_segments_Line_segment_intersection)&oldid=44570"