https://github.com/iceman201/cosc262
:book:Algorithm&Computer Graphic:book:
https://github.com/iceman201/cosc262
Last synced: 4 months ago
JSON representation
:book:Algorithm&Computer Graphic:book:
- Host: GitHub
- URL: https://github.com/iceman201/cosc262
- Owner: iceman201
- Created: 2014-02-27T11:08:56.000Z (over 12 years ago)
- Default Branch: master
- Last Pushed: 2016-12-03T11:30:54.000Z (over 9 years ago)
- Last Synced: 2025-10-11T10:39:24.509Z (8 months ago)
- Language: Python
- Homepage:
- Size: 2.18 MB
- Stars: 3
- Watchers: 3
- Forks: 2
- Open Issues: 0
-
Metadata Files:
- Readme: README.md
Awesome Lists containing this project
README
COSC262
=======
In this assignment II, you will implement methods for computing the convex hulls of twodimensional
points, and evaluate their performance using point data sets. For
comparative analysis and testing of the methods, three programs are required to be
developed as outlined below
i. giftwrap.py: This program should contain the implementation of the
“Simplified Gift-Wrap” algorithm based on the method given on Slide [1.1]-23
ii. grahamscan.py: This program should contain a stack-based implementation
of the Graham-Scan algorithm as outlined on Slide [1.1]-28.
iii. amethod.py: This could be any other non-naïve method for computing the
convex hull of a set of points (eg., insertion hull, quick hull), or a suggested
improvement of the methods in (i) or (ii).
Each of the three programs must be able to read up to 12000 points from an input file,
and output a single line containing the indices of the convex hull vertices. The programs
should be able to read the input file name specified as the command line argument, eg.,
python giftwrap.py A_500.dat
For this, you will need to use the sys module (import sys) in the program as
shown below. The file name will then be available in sys.argv[1]
Algorithm&Computer Graphic