# Line Intersections

Revision as of 06:25, 15 September 2021 by Yashsherry (talk | contribs) (Created page with "== Problem Description== the line segment intersection problem supplies a list of line segments in the Euclidean plane and asks whether any two of them intersect (cross). ==...")

## Problem Description

the line segment intersection problem supplies a list of line segments in the

Euclidean plane and asks whether any two of them intersect (cross).

## Bounds Chart

## Step Chart

## Improvement Table

Complexity Classes | Algorithm Paper Links | Lower Bounds Paper Links |
---|---|---|

Exp/Factorial | ||

Polynomial > 3 | ||

Cubic | ||

Quadratic | ||

nlogn | ||

Linear | ||

logn |