Convex_Hull_Problem

An assignment of COMP-370 Algorithms

The Individual task

Implement a program, in any programming language of your choice, for comparing each of the 3 different algorithms described below (Graham scan, Gift wrapping and QuickHull).

Name		Name	Last commit message	Last commit date
Latest commit History 17 Commits
CMakeLists.txt		CMakeLists.txt
Point.cpp		Point.cpp
Point.h		Point.h
README.md		README.md
divideAndConquer.cpp		divideAndConquer.cpp
divideAndConquer.h		divideAndConquer.h
giftWrapping.cpp		giftWrapping.cpp
giftWrapping.h		giftWrapping.h
global.h		global.h
grahamScan.cpp		grahamScan.cpp
grahamScan.h		grahamScan.h
heapSort.cpp		heapSort.cpp
heapSort.h		heapSort.h
main.cpp		main.cpp
menu.cpp		menu.cpp
menu.h		menu.h
misc.cpp		misc.cpp
misc.h		misc.h
pointSet.cpp		pointSet.cpp
pointSet.h		pointSet.h
visualOutput.cpp		visualOutput.cpp
visualOutput.h		visualOutput.h

Navigation Menu

Repository files navigation

Convex_Hull_Problem

The Individual task

About

Releases

Packages

Contributors

Languages

Folders and files

Latest commit

History

Repository files navigation

Convex_Hull_Problem

The Individual task

About

Resources

Stars

Watchers

Forks

Releases

Packages

Contributors

Languages