Welcome to Our Algorithms Project

Lines Intersection

Orientation Based Approach

Cross Product Approach

ParametricApproach

Graham Scan

- Time Complexity: O(n log n)

- Space Complexity: O(n)

Monotone Chain

- Time Complexity: O(n log n)

- Space Complexity: O(n)

Jarvis March

- Time Complexity: O(nh), where h is the number of vertices on the convex hull

- Space Complexity: O(n+h)

Quick Elimination

- Time Complexity: O(n log n) on average, but can degrade to O(n²)) in the worst case

- Space Complexity: O(n)

Brute Force

- Time Complexity: O(n³) in the worst case (using rotating calipers method)

- Space Complexity: O(1)