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.
-
Notifications
You must be signed in to change notification settings - Fork 0
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).
levongh/graham_convex_hull
Folders and files
| Name | Name | Last commit message | Last commit date | |
|---|---|---|---|---|
Repository files navigation
About
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).
Resources
Stars
Watchers
Forks
Releases
No releases published
Packages 0
No packages published