NIEVERGELT. J.. AND PREPARATA (Section 3) (Reporting all intersection points, convex polygons Line segment intersection)

From Algorithm Wiki

Jump to navigation Jump to search

Time Complexity

$O( n \log n + k )$

Space Complexity

$O(n)$ words

(https://courses.cs.duke.edu/cps234/spring04/papers/NP82.pdf)

Description

Approximate?

Exact

Randomized?

No, deterministic

Model of Computation

Real RAM

Year

1982

Reference

https://pdfs.semanticscholar.org/a571/cc92218132a1b0e65c2adbf663c79d015737.pdf

Retrieved from "https://algorithm-wiki.csail.mit.edu/w/index.php?title=NIEVERGELT._J.._AND_PREPARATA_(Section_3)_(Reporting_all_intersection_points,_convex_polygons_Line_segment_intersection)&oldid=47336"