https://github.com/grantgasser/algorithms-project
Closest Pair and Convex Hull
https://github.com/grantgasser/algorithms-project
brute-force closest-pair convex-hull divide-and-conquer
Last synced: 3 months ago
JSON representation
Closest Pair and Convex Hull
- Host: GitHub
- URL: https://github.com/grantgasser/algorithms-project
- Owner: grantgasser
- Created: 2019-04-01T18:37:30.000Z (over 6 years ago)
- Default Branch: master
- Last Pushed: 2019-05-07T21:17:17.000Z (about 6 years ago)
- Last Synced: 2025-02-08T18:14:30.899Z (5 months ago)
- Topics: brute-force, closest-pair, convex-hull, divide-and-conquer
- Language: C++
- Size: 15.2 MB
- Stars: 0
- Watchers: 3
- Forks: 1
- Open Issues: 0
-
Metadata Files:
- Readme: README.md
Awesome Lists containing this project
README
# Algorithms Project
Using C++ and the SDL, write an application to graphically represent the runtime characteristics of the following closest-pair algorithms.* Brute-Force Closest-Pair
* Divide-And-Conquer Closest Pair
* Brute-Force Convex Hull
- https://semisignal.com/brute-force-convex-hull-construction/
* Divide-And-Conquer Convex Hull
- https://www.geeksforgeeks.org/convex-hull-set-2-graham-scan/