File jarvis_march.py

geometry/jarvis_march.py:None–None · view source on GitHub ↗

Source from the content-addressed store, hash-verified

1	"""
2	Jarvis March (Gift Wrapping) algorithm for finding the convex hull of a set of points.
3
4	The convex hull is the smallest convex polygon that contains all the points.

nothing calls this directly

jarvis_marchFunction · 0.85

PointClass · 0.70

no test coverage detected