{"id":18303362,"url":"https://github.com/selimchraibi/bentleyottmanalgorithm","last_synced_at":"2025-06-30T10:02:16.404Z","repository":{"id":198291023,"uuid":"112935111","full_name":"SelimChraibi/BentleyOttmanAlgorithm","owner":"SelimChraibi","description":"Sweep line algorithm for listing all crossings in a set of line segments. [2016]","archived":false,"fork":false,"pushed_at":"2018-04-07T06:35:16.000Z","size":90,"stargazers_count":0,"open_issues_count":0,"forks_count":1,"subscribers_count":0,"default_branch":"master","last_synced_at":"2025-04-09T10:16:29.980Z","etag":null,"topics":[],"latest_commit_sha":null,"homepage":null,"language":"Python","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/SelimChraibi.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}},"created_at":"2017-12-03T14:33:43.000Z","updated_at":"2018-04-07T06:35:18.000Z","dependencies_parsed_at":"2023-10-05T07:00:16.005Z","dependency_job_id":null,"html_url":"https://github.com/SelimChraibi/BentleyOttmanAlgorithm","commit_stats":null,"previous_names":["selimchraibi/bentleyottmanalgorithm"],"tags_count":0,"template":false,"template_full_name":null,"purl":"pkg:github/SelimChraibi/BentleyOttmanAlgorithm","repository_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/SelimChraibi%2FBentleyOttmanAlgorithm","tags_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/SelimChraibi%2FBentleyOttmanAlgorithm/tags","releases_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/SelimChraibi%2FBentleyOttmanAlgorithm/releases","manifests_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/SelimChraibi%2FBentleyOttmanAlgorithm/manifests","owner_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners/SelimChraibi","download_url":"https://codeload.github.com/SelimChraibi/BentleyOttmanAlgorithm/tar.gz/refs/heads/master","sbom_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/SelimChraibi%2FBentleyOttmanAlgorithm/sbom","host":{"name":"GitHub","url":"https://github.com","kind":"github","repositories_count":262753013,"owners_count":23358878,"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-11-05T15:25:26.805Z","updated_at":"2025-06-30T10:02:16.349Z","avatar_url":"https://github.com/SelimChraibi.png","language":"Python","readme":"# Bentley Ottman Algorithm\n\n*First year Python project at Ensimag - Grenoble INP - 2016*\n\n![100_lines](https://i.imgur.com/eXdf4dr.png)\n\nImplementation of the [Bentley-Ottman algorithm](https://en.wikipedia.org/wiki/Bentley–Ottmann_algorithm).\n\u003e The Bentley–Ottmann algorithm is a sweep line algorithm for listing all crossings in a set of line segments.\n\n## Usage\n\n```sh\n./bo.py -h\nusage: bo.py [-h] [-s] [-t] [-l] filepaths [filepaths ...]\n\nList all crossings in a set of line segments using the Bentley–Ottmann algorithm.\n\npositional arguments:\n  filepaths   filepaths of the .bo files to analyse\n\noptional arguments:\n  -h, --help  show this help message and exit\n  -s          save the results as svg in ./outputs\n  -t          tycat the results\n  -l          add results to a log.csv file\n```\n\n## Use example\n\n```sh\n./bo.py -s -l ./tests/simple.bo\n\n    Running Bentley Ottmann on simple ...\n\n    [=========================] 100%\n\n    Unique intersections          :   1\n    Crossings within segments     :   2\n    Runtime for Bentley Ottmann   :   0m 0.0008020401000976562s\n\n\n    Running naive algorithm on simple ...\n\n    [=========================] 100%\n\n\n    Runtime for naive algorithm   :   0m 9.799003601074219e-05s\n\n```\n\n### Performance\n\nComparison with a naive algorithm (see `naive.py`) on 200 random lines:\n\n![200_lines_with_crossings](https://i.imgur.com/kxirU2w.png)\n","funding_links":[],"categories":[],"sub_categories":[],"project_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fselimchraibi%2Fbentleyottmanalgorithm","html_url":"https://awesome.ecosyste.ms/projects/github.com%2Fselimchraibi%2Fbentleyottmanalgorithm","lists_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fselimchraibi%2Fbentleyottmanalgorithm/lists"}