Jump to navigation Jump to search
the line segment intersection problem supplies a list of line segments in the
Euclidean plane and asks whether any two of them intersect (cross).
|Complexity Classes||Algorithm Paper Links||Lower Bounds Paper Links|
|Polynomial > 3|