https://github.com/levongh/graham_convex_hull
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).
https://github.com/levongh/graham_convex_hull
Last synced: 10 months ago
JSON representation
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).
- Host: GitHub
- URL: https://github.com/levongh/graham_convex_hull
- Owner: levongh
- Created: 2016-12-22T12:46:26.000Z (over 9 years ago)
- Default Branch: master
- Last Pushed: 2023-05-29T15:22:03.000Z (about 3 years ago)
- Last Synced: 2025-02-09T09:12:29.500Z (over 1 year ago)
- Language: C++
- Homepage: https://en.wikipedia.org/wiki/Graham_scan
- Size: 4.88 KB
- Stars: 0
- Watchers: 3
- Forks: 0
- Open Issues: 0
-
Metadata Files:
- Readme: README.md
Awesome Lists containing this project
README
# graham_convex_hull
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).
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.