{"id":31906623,"url":"https://github.com/garrisonj/convexhullalgorithms","last_synced_at":"2026-07-22T15:31:30.926Z","repository":{"id":14474691,"uuid":"17186885","full_name":"GarrisonJ/ConvexHullAlgorithms","owner":"GarrisonJ","description":"cs350 project","archived":false,"fork":false,"pushed_at":"2014-02-27T22:12:25.000Z","size":279,"stargazers_count":0,"open_issues_count":0,"forks_count":0,"subscribers_count":1,"default_branch":"master","last_synced_at":"2025-10-21T19:58:54.266Z","etag":null,"topics":[],"latest_commit_sha":null,"homepage":"","language":"Ruby","has_issues":true,"has_wiki":null,"has_pages":null,"mirror_url":null,"source_name":"RubyLouvre/avalon","license":null,"status":null,"scm":"git","pull_requests_enabled":true,"icon_url":"https://github.com/GarrisonJ.png","metadata":{"files":{"readme":"README.md","changelog":null,"contributing":null,"funding":null,"license":null,"code_of_conduct":null,"threat_model":null,"audit":null,"citation":null,"codeowners":null,"security":null,"support":null}},"created_at":"2014-02-25T20:21:42.000Z","updated_at":"2014-02-27T22:12:25.000Z","dependencies_parsed_at":"2022-09-07T13:01:24.689Z","dependency_job_id":null,"html_url":"https://github.com/GarrisonJ/ConvexHullAlgorithms","commit_stats":null,"previous_names":[],"tags_count":0,"template":false,"template_full_name":null,"purl":"pkg:github/GarrisonJ/ConvexHullAlgorithms","repository_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/GarrisonJ%2FConvexHullAlgorithms","tags_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/GarrisonJ%2FConvexHullAlgorithms/tags","releases_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/GarrisonJ%2FConvexHullAlgorithms/releases","manifests_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/GarrisonJ%2FConvexHullAlgorithms/manifests","owner_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners/GarrisonJ","download_url":"https://codeload.github.com/GarrisonJ/ConvexHullAlgorithms/tar.gz/refs/heads/master","sbom_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/GarrisonJ%2FConvexHullAlgorithms/sbom","scorecard":null,"host":{"name":"GitHub","url":"https://github.com","kind":"github","repositories_count":286080680,"owners_count":35768234,"icon_url":"https://github.com/github.png","version":null,"created_at":"2022-05-30T11:31:42.601Z","updated_at":"2026-07-20T02:08:10.276Z","status":"online","status_checked_at":"2026-07-22T02:00:06.236Z","response_time":124,"last_error":null,"robots_txt_status":"success","robots_txt_updated_at":"2025-07-24T06:49:26.215Z","robots_txt_url":"https://github.com/robots.txt","online":true,"can_crawl_api":true,"host_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub","repositories_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories","repository_names_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repository_names","owners_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners"}},"keywords":[],"created_at":"2025-10-13T14:52:59.279Z","updated_at":"2026-07-22T15:31:30.898Z","avatar_url":"https://github.com/GarrisonJ.png","language":"Ruby","funding_links":[],"categories":[],"sub_categories":[],"readme":"CS350  \nGarrison Jensen  \nProject proposal\n\n## Project: Convex Hull\n\n### Project Topic\n\nFor my project I will compare the two algorithms we learned in class for finding the convex hull of a given set of points, the Quick-Hull and the brute force algorithm. I will compare the time efficiency both mathematically and empirically for random sets of points. I will also compare them on some special cases, such as a set of points in a circle, and points on a line. \n\nI think it will be interesting to see if the brute force algorithm ever out performs the Quick-Hull algorithm on any sets. And if so, by how much.\n\n### Implementation Language\n\nFor this project I plan to use the Ruby programming language. I chose this language for several reasons. First, I am experienced with Ruby. Second, Ruby is easy to read, which will allow me to analyse the efficiency of the algorithm without getting caught up in complicated syntax. \n\nAlso, Ruby has a simple and easy to use testing module, Benchmark, which will allow me to write extensive test. And a nice graphing library, RubyVis, which will allow me to make graphical representation of my test output.  \n\n### Features in Final Report\n\t- A mathematical analysis of time efficiency.\n\t\t- Quick-Hull\n\t\t- Brute Force Hull\n\t- An empirical analysis of time efficiency.\n\t\t- Quick-Hull\n\t\t- Brute Force Hull\n\t- A graphical representation of tests input and output.\n\t\t- A point chart of special cases of test input. \n\t\t- A bar graph showing time taken on different sized input sets. \n\t- A written report analyzing the collected data.\n\t- Optional\n\t\t- Implementation and analysis of the Graham Scan algorithm. \n\n### Time Plan\n\nThis is my tentative time plan for the project. \n\n\t- 27 Feb  \n\t\t- Have both algorithms implemented.  \n\t\t- Complete the mathematical analysis of brute force algorithm.  \n \t\t- Complete the mathematical analysis of Quick-Hull algorithm.  \n\t- 6 March    \n \t\t- Complete the empirical analysis of brute force algorithm.  \n\t\t- Complete the empirical analysis of Quick-Hull algorithm.  \n\t\t- Create graphs representing empirical analysis.  \n\t- 13 March  \n \t\t- Write an analyse of collected date.  \n \t\t- Come up with conclusions about the efficiency of algorithms.  \n\t\t- Complete written report.   \n","project_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fgarrisonj%2Fconvexhullalgorithms","html_url":"https://awesome.ecosyste.ms/projects/github.com%2Fgarrisonj%2Fconvexhullalgorithms","lists_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fgarrisonj%2Fconvexhullalgorithms/lists"}