Reporting all intersection points, general polygons (Line segment intersection)
In this case, we are supplied with a list of polygons (not necessarily convex), and we wish to report all regions of intersection.
$n$: number of line segments
$k$: number of points of intersection
Table of Algorithms
Currently no algorithms in our database for the given problem.