{"id":16352280,"url":"https://github.com/bugthesystem/polylabel","last_synced_at":"2025-11-20T01:30:15.948Z","repository":{"id":149223119,"uuid":"92175681","full_name":"bugthesystem/polylabel","owner":"bugthesystem","description":"A fast algorithm for finding the pole of inaccessibility of a polygon","archived":false,"fork":false,"pushed_at":"2017-05-31T15:29:54.000Z","size":396,"stargazers_count":1,"open_issues_count":0,"forks_count":0,"subscribers_count":1,"default_branch":"master","last_synced_at":"2025-02-14T13:06:23.798Z","etag":null,"topics":[],"latest_commit_sha":null,"homepage":null,"language":"Scala","has_issues":true,"has_wiki":null,"has_pages":null,"mirror_url":null,"source_name":null,"license":"other","status":null,"scm":"git","pull_requests_enabled":true,"icon_url":"https://github.com/bugthesystem.png","metadata":{"files":{"readme":"README.md","changelog":null,"contributing":null,"funding":null,"license":"LICENSE","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":"2017-05-23T13:24:31.000Z","updated_at":"2017-07-01T13:36:09.000Z","dependencies_parsed_at":null,"dependency_job_id":"8ebe72d7-0e0e-4de5-ba45-12e61928d80c","html_url":"https://github.com/bugthesystem/polylabel","commit_stats":null,"previous_names":["bugthesystem/polylabel"],"tags_count":0,"template":false,"template_full_name":null,"repository_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/bugthesystem%2Fpolylabel","tags_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/bugthesystem%2Fpolylabel/tags","releases_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/bugthesystem%2Fpolylabel/releases","manifests_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/bugthesystem%2Fpolylabel/manifests","owner_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners/bugthesystem","download_url":"https://codeload.github.com/bugthesystem/polylabel/tar.gz/refs/heads/master","host":{"name":"GitHub","url":"https://github.com","kind":"github","repositories_count":239619573,"owners_count":19669447,"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-11T01:25:34.487Z","updated_at":"2025-11-20T01:30:15.883Z","avatar_url":"https://github.com/bugthesystem.png","language":"Scala","funding_links":[],"categories":[],"sub_categories":[],"readme":"# polylabel.scala\nA fast algorithm for finding the pole of inaccessibility of a polygon\n\n![](https://raw.githubusercontent.com/ziyasal/polylabel/master/misc/img.png)\n\n## Sample Code\n\n```scala\n\nimport polylabel._\n\n// [[[0, 0], [1, 0], [2, 0], [0, 0]]]\nval polygon = Array(Array(Point(0, 0), Point(1, 0), Point(2, 0), Point(0, 0)))\n\nval p1 = polylabel(polygon)\n\n\n//p1: Array[Double] = Array(0.0, 0.0)\n\n ```\n\n## TODO\n - Documentation\n","project_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fbugthesystem%2Fpolylabel","html_url":"https://awesome.ecosyste.ms/projects/github.com%2Fbugthesystem%2Fpolylabel","lists_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fbugthesystem%2Fpolylabel/lists"}