Demo of a divide-and-conquer approach to the convex hull problem. Analogous to the mergesort sorting algorithm.
I wrote this as an independent project for Dr. Robert Pless's excellent course on Computational Geometry at WUSTL.
Screenshot:
This repository has been archived by the owner on May 17, 2020. It is now read-only.
-
Notifications
You must be signed in to change notification settings - Fork 0
donmccurdy/convex-hull
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
Demo of MergeHull algorithm for the convex hull problem.
Resources
Stars
Watchers
Forks
Releases
No releases published
Packages 0
No packages published