Questions tagged [convex-hull]
The convex hull of a group of points X within a Euclidean space can be described as the smallest possible convex set that completely encompasses all of the points in X while occupying the least amount of area.
It is said that the Graham scan algorithm can efficiently find the convex hull of a simple polygon in linear time without requiring the nlogn sorting step since the vertices are already effectively sorted. I have implemented the Graham scan algorithm, and ...