{"id":18176715,"url":"https://github.com/jayllyz/jarvis-asm","last_synced_at":"2025-04-07T10:50:11.204Z","repository":{"id":133066329,"uuid":"570297919","full_name":"Jayllyz/Jarvis-asm","owner":"Jayllyz","description":"Jarvis march using assembly","archived":false,"fork":false,"pushed_at":"2023-01-09T10:34:47.000Z","size":21,"stargazers_count":0,"open_issues_count":1,"forks_count":0,"subscribers_count":1,"default_branch":"main","last_synced_at":"2025-04-04T04:32:13.321Z","etag":null,"topics":["assembly","jarvis"],"latest_commit_sha":null,"homepage":"","language":"Assembly","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/Jayllyz.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":"2022-11-24T20:36:54.000Z","updated_at":"2023-01-19T08:07:40.000Z","dependencies_parsed_at":null,"dependency_job_id":"c29f5d91-8dd1-4f7c-87fe-a657c1af5840","html_url":"https://github.com/Jayllyz/Jarvis-asm","commit_stats":null,"previous_names":[],"tags_count":2,"template":false,"template_full_name":null,"repository_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/Jayllyz%2FJarvis-asm","tags_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/Jayllyz%2FJarvis-asm/tags","releases_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/Jayllyz%2FJarvis-asm/releases","manifests_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/Jayllyz%2FJarvis-asm/manifests","owner_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners/Jayllyz","download_url":"https://codeload.github.com/Jayllyz/Jarvis-asm/tar.gz/refs/heads/main","host":{"name":"GitHub","url":"https://github.com","kind":"github","repositories_count":247640557,"owners_count":20971555,"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":["assembly","jarvis"],"created_at":"2024-11-02T17:11:18.870Z","updated_at":"2025-04-07T10:50:11.183Z","avatar_url":"https://github.com/Jayllyz.png","language":"Assembly","funding_links":[],"categories":[],"sub_categories":[],"readme":"\u003ch1 align=\"center\"\u003e Gift wrapping algorithm  \u003c/h1\u003e\n\n\u003cp align=\"center\"\u003e\n  Assembly ESGI Project\n\u003c/p\u003e\n\n\u003cdiv align=\"center\"\u003e\u003cimg align=\"center\" alt=\"Project screen\" src=\"https://user-images.githubusercontent.com/16305216/211287951-75993a02-c00b-46bf-865c-418885fb9729.png\"\u003e\u003c/div\u003e\n\n## Table of Contents\n\n- [Table of Contents](#table-of-contents)\n- [Description](#description)\n- [Compilation](#compilation)\n- [Contributors](#contributors)\n\n## Description\n\nThe Gift Wrapping algorithm, also known as the Jarvis March, is an algorithm for finding the convex hull of a set of points in the plane. A convex hull is the smallest convex polygon that contains all of the points in a given set.\n\nHere is a high-level overview of the steps involved in the Gift Wrapping algorithm:\n\n1 - Choose a point on the convex hull as the starting point.\n\n2 - Initialize an empty list to store the points on the convex hull.\n\n3 - Set the current point to be the starting point.\n\n4 - Find the point that is most counter-clockwise relative to the current point.\n\n5 - If the found point is the starting point, return the list of points on the convex hull.\n\n6 - Otherwise, add the found point to the list and set it to be the current point.\n\n7 - Go back to step 4.\n\nIn this implementation, we also add one point to the list, and then we search if he is inside the convex hull.\n\n## Compilation\n\n```bash\nsu - # You need to be user root otherwise you will have seg fault.\ncd # Go to your project directory\ncompile64 jarvis.asm\nexit\n./jarvis\n```\n\n## Contributors\n\n[@userMeh](https://github.com/userMeh) \u0026 [@Jayllyz](https://github.com/Jayllyz) \u0026 [@Minatoco](https://github.com/minatoco)\n","project_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fjayllyz%2Fjarvis-asm","html_url":"https://awesome.ecosyste.ms/projects/github.com%2Fjayllyz%2Fjarvis-asm","lists_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fjayllyz%2Fjarvis-asm/lists"}