Reporting all intersection points, convex polygons (Line segment intersection)
Jump to navigation Jump to search
In this case, we are supplied with a list of convex polygons, and we wish to report all regions of intersection.
Generalizations: Reporting all intersection points, general polygons
$n$: number of line segments
$k$: number of points of intersection
Table of Algorithms
|NIEVERGELT. J.. AND PREPARATA (Section 3)||1982||$O( n \log n + k )$||$O(n)$||Exact||Deterministic||Time & Space|