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.
Andreas Bernatzky 19.08.2019
Andreas Bernatzky (2024). Graham-Scan (https://github.com/TypHo22/Graham-Scan), GitHub. Retrieved .
MATLAB Release Compatibility
Platform CompatibilityWindows macOS Linux
Community Treasure Hunt
Find the treasures in MATLAB Central and discover how the community can help you!Start Hunting!
Versions that use the GitHub default branch cannot be downloaded