Reporting all intersection points, general polygons (Line segment intersection)

Description

In this case, we are supplied with a list of polygons (not necessarily convex), and we wish to report all regions of intersection.

Related Problems

Subproblem: Reporting all intersection points, convex polygons

Related: Reporting all intersection points, line segments, Reporting all intersection points, generalized segments, Counting number of intersection points, line segments

Parameters

$n$: number of line segments

$k$: number of points of intersection

Table of Algorithms

Currently no algorithms in our database for the given problem.

References/Citation

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