{"id":27208016,"url":"https://github.com/simonedavico/line-segments","last_synced_at":"2026-04-14T18:33:42.911Z","repository":{"id":87375181,"uuid":"111995213","full_name":"simonedavico/line-segments","owner":"simonedavico","description":"Line segments code challenge implementation in Kotlin","archived":false,"fork":false,"pushed_at":"2018-06-08T08:13:23.000Z","size":86,"stargazers_count":0,"open_issues_count":1,"forks_count":1,"subscribers_count":3,"default_branch":"develop","last_synced_at":"2025-04-09T23:59:05.417Z","etag":null,"topics":["kotlin","line-patterns","vertx"],"latest_commit_sha":null,"homepage":null,"language":null,"has_issues":true,"has_wiki":null,"has_pages":null,"mirror_url":null,"source_name":null,"license":"mit","status":null,"scm":"git","pull_requests_enabled":true,"icon_url":"https://github.com/simonedavico.png","metadata":{"files":{"readme":"README.md","changelog":"CHANGELOG.md","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-11-25T10:29:36.000Z","updated_at":"2017-11-26T17:43:08.000Z","dependencies_parsed_at":null,"dependency_job_id":"cbda1302-a477-474f-bfa9-230e3f9f49fe","html_url":"https://github.com/simonedavico/line-segments","commit_stats":null,"previous_names":[],"tags_count":0,"template":false,"template_full_name":null,"purl":"pkg:github/simonedavico/line-segments","repository_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/simonedavico%2Fline-segments","tags_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/simonedavico%2Fline-segments/tags","releases_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/simonedavico%2Fline-segments/releases","manifests_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/simonedavico%2Fline-segments/manifests","owner_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners/simonedavico","download_url":"https://codeload.github.com/simonedavico/line-segments/tar.gz/refs/heads/develop","sbom_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/simonedavico%2Fline-segments/sbom","scorecard":null,"host":{"name":"GitHub","url":"https://github.com","kind":"github","repositories_count":279202496,"owners_count":26125291,"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","status":"online","status_checked_at":"2025-10-16T02:00:06.019Z","response_time":53,"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":["kotlin","line-patterns","vertx"],"created_at":"2025-04-09T23:59:04.013Z","updated_at":"2025-10-16T14:18:24.520Z","avatar_url":"https://github.com/simonedavico.png","language":null,"funding_links":[],"categories":[],"sub_categories":[],"readme":"# Programming Test - Pattern Recognition\n\n## Pattern Recognition\n\nComputer vision involves analyzing patterns in visual images and reconstructing the real world objects that produced them. The process in often broken up into two phases: feature detection and pattern recognition. Feature detection involves selecting important features of the image; pattern recognition involves discovering patterns in the features. We will investigate a particularly clean pattern recognition problem involving points and line segments. This kind of pattern recognition arises in many other applications, for example statistical data analysis.\n\n## Problem to solve\n\nGiven a set of N feature points in the plane, determine every line that contains N or more of the points, and return all points involved.\nYou should also expose a REST API that will allow the caller to: \n\n* Add a point to the space \n\n    ```\n    POST /point with body { \"x\": ..., \"y\": ... }\n    ```\n\n* Get all points in the space\n    \n    ```\n    GET /space\n    ```\n\n* Get all line segments passing through at least N points. Note that a line segment should be a set of points.\n\n    ```\n    GET /lines/{n}\n    ```\n\n* Remove all points from the space\n\n    ```\n    DELETE /space\n    ```\n\n## Additional rules\n\n* All code should be under version control, on a publicly accessible git repository (e.g., a GitHub repository);\n* Unless specified in the instructions above, the API should consume and produce JSON;\n* The languages you can choose to implement are: Java, Kotlin, JavaScript. Other web/JVM based languages could be taken into consideration. \n\n## Suggestions\n\n* Properly naming variables and documenting the code can help us understand your solution;\n* Validating all inputs to your program will help your solution pass our test cases;\n* There is no bound on the computational complexity of the solution, but solutions with good computational complexity will earn you bonus points.\n\n## N.B.\n\nIf you are using MacOS Sierra add to your `/etc/hosts` file a mapping to the canonical `127.0.0.1` address for your Mac hostname.\n\n```\n127.0.0.1   localhost mbpro.local\n::1         localhost mbpro.local\n```","project_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fsimonedavico%2Fline-segments","html_url":"https://awesome.ecosyste.ms/projects/github.com%2Fsimonedavico%2Fline-segments","lists_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fsimonedavico%2Fline-segments/lists"}