Line Intersections

From Algorithm Wiki
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). ==...")
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
Jump to navigation Jump to search

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

Line segment intersectionBoundsChart.png

Step Chart

Line segment intersectionStepChart.png

Improvement Table

Complexity Classes Algorithm Paper Links Lower Bounds Paper Links
Exp/Factorial
Polynomial > 3
Cubic
Quadratic
nlogn
Linear
logn