- Notifications
You must be signed in to change notification settings - Fork0
Algorithms for finding the convex hull of a set of 2d points and an experimental framework to compare the algorithms. Algorithms include Jarvis March, Graham Scan, and Chan's Algorithm.
License
NotificationsYou must be signed in to change notification settings
igreat/convex-hull
Folders and files
| Name | Name | Last commit message | Last commit date | |
|---|---|---|---|---|
Repository files navigation
Full implementations of three major algorithms for finding theconvex hull of a set of points:
- Jarvix March
- Graham Scan
- Chan's Algorithm
The code also includes a simple experimental framework to compare the performance of the three algorithms, along with plenty of sample experiments.
Read thefull report for our findings and conclusions.