Algorithm for calculating a convex hull around a point cloud Graham's scan is a method of finding the convex hull of a finite set of points in the plane with time complexity O(n log n). It is named after Ronald Graham, who published the original algorithm in 1972. The algorithm finds all vertices of the convex hull ordered along its boundary. It uses a stack to detect and remove concavities in the boundary efficiently.
Further Informations: https://en.wikipedia.org/wiki/Graham_scan https://www.youtube.com/watch?v=VP9ylElm1yY
Andreas Bernatzky 20.08.2019