Module jarvis_march 

Jarvis march (Gift Wrapping) algorithm implementation for 2D convex hull computation

The Jarvis march algorithm, also known as the Gift Wrapping algorithm, computes the convex hull by starting from the leftmost point and “wrapping” around the point set by repeatedly finding the most counterclockwise point.

Functions

compute_jarvis_march

Compute convex hull using Jarvis march (Gift Wrapping) algorithm (2D only)

find_leftmost_point

Find the leftmost point in the point set

find_most_counterclockwise

Find the most counterclockwise point from a given point

is_more_counterclockwise

Check if a point is more counterclockwise than another

jarvis_step

Perform one step of the Jarvis march