My implementation of Graham's Scan Algorithm for 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.
-
Notifications
You must be signed in to change notification settings - Fork 0
abhinav-bohra/Graham-Scan-Algorithm
This commit does not belong to any branch on this repository, and may belong to a fork outside of the repository.
Folders and files
| Name | Name | Last commit message | Last commit date | |
|---|---|---|---|---|
Repository files navigation
About
My implementation of Graham's Scan Algorithm for finding the convex hull of a finite set of points in the plane with time complexity O(N*log(N)).
Topics
Resources
Stars
Watchers
Forks
Releases
No releases published
Packages 0
No packages published