{"id":15468840,"url":"https://github.com/levongh/graham_convex_hull","last_synced_at":"2025-08-12T06:39:57.683Z","repository":{"id":161116707,"uuid":"77143989","full_name":"levongh/graham_convex_hull","owner":"levongh","description":"Graham's scan is a method of finding the convex hull of a finite set of points in the plane with time complexity O(n log n).","archived":false,"fork":false,"pushed_at":"2023-05-29T15:22:03.000Z","size":5,"stargazers_count":0,"open_issues_count":0,"forks_count":0,"subscribers_count":3,"default_branch":"master","last_synced_at":"2025-02-09T09:12:29.500Z","etag":null,"topics":[],"latest_commit_sha":null,"homepage":"https://en.wikipedia.org/wiki/Graham_scan","language":"C++","has_issues":true,"has_wiki":null,"has_pages":null,"mirror_url":null,"source_name":null,"license":null,"status":null,"scm":"git","pull_requests_enabled":true,"icon_url":"https://github.com/levongh.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,"governance":null,"roadmap":null,"authors":null,"dei":null,"publiccode":null,"codemeta":null}},"created_at":"2016-12-22T12:46:26.000Z","updated_at":"2023-05-29T15:22:08.000Z","dependencies_parsed_at":null,"dependency_job_id":"760c8d95-97e8-41d6-8899-68bc271f4e9f","html_url":"https://github.com/levongh/graham_convex_hull","commit_stats":{"total_commits":6,"total_committers":3,"mean_commits":2.0,"dds":0.5,"last_synced_commit":"35c03e048805398f2883761ef9a3861bdb58efbc"},"previous_names":[],"tags_count":0,"template":false,"template_full_name":null,"repository_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/levongh%2Fgraham_convex_hull","tags_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/levongh%2Fgraham_convex_hull/tags","releases_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/levongh%2Fgraham_convex_hull/releases","manifests_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/levongh%2Fgraham_convex_hull/manifests","owner_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners/levongh","download_url":"https://codeload.github.com/levongh/graham_convex_hull/tar.gz/refs/heads/master","host":{"name":"GitHub","url":"https://github.com","kind":"github","repositories_count":247078803,"owners_count":20879951,"icon_url":"https://github.com/github.png","version":null,"created_at":"2022-05-30T11:31:42.601Z","updated_at":"2022-07-04T15:15:14.044Z","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":"2024-10-02T01:44:59.668Z","updated_at":"2025-04-03T20:46:19.409Z","avatar_url":"https://github.com/levongh.png","language":"C++","funding_links":[],"categories":[],"sub_categories":[],"readme":"# graham_convex_hull\nGraham's scan is a method of finding the convex hull of a finite set of points in the plane with time complexity O(n log n).\nThe algorithm finds all vertices of the convex hull ordered along its boundary. It uses a stack to detect and remove concavities\nin the boundary efficiently.\n\n","project_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Flevongh%2Fgraham_convex_hull","html_url":"https://awesome.ecosyste.ms/projects/github.com%2Flevongh%2Fgraham_convex_hull","lists_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Flevongh%2Fgraham_convex_hull/lists"}