MCPcopy Index your code
hub / github.com/TheAlgorithms/Python / convex_hull.py

File convex_hull.py

divide_and_conquer/convex_hull.py:None–None  ·  view source on GitHub ↗

Source from the content-addressed store, hash-verified

1"""
2The convex hull problem is problem of finding all the vertices of convex polygon, P of
3a set of points in a plane such that all the points are either on the vertices of P or
4inside P. TH convex hull problem has several applications in geometrical problems,

Callers

nothing calls this directly

Calls 1

mainFunction · 0.70

Tested by

no test coverage detected