{"id":"https://openalex.org/W3037212754","doi":"https://doi.org/10.1007/s00454-021-00351-y","title":"A Greedy Algorithm to Compute Arrangements of Lines in the Projective Plane","display_name":"A Greedy Algorithm to Compute Arrangements of Lines in the Projective Plane","publication_year":2021,"publication_date":"2021-12-20","ids":{"openalex":"https://openalex.org/W3037212754","doi":"https://doi.org/10.1007/s00454-021-00351-y","mag":"3037212754"},"language":"en","primary_location":{"id":"doi:10.1007/s00454-021-00351-y","is_oa":true,"landing_page_url":"https://doi.org/10.1007/s00454-021-00351-y","pdf_url":"https://link.springer.com/content/pdf/10.1007/s00454-021-00351-y.pdf","source":{"id":"https://openalex.org/S103671469","display_name":"Discrete & Computational Geometry","issn_l":"0179-5376","issn":["0179-5376","1432-0444"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319900","host_organization_name":"Springer Science+Business Media","host_organization_lineage":["https://openalex.org/P4310319900","https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Science+Business Media","Springer Nature"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Discrete & Computational Geometry","raw_type":"journal-article"},"type":"article","indexed_in":["crossref","datacite"],"open_access":{"is_oa":true,"oa_status":"hybrid","oa_url":"https://link.springer.com/content/pdf/10.1007/s00454-021-00351-y.pdf","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5082130619","display_name":"Michael Cuntz","orcid":"https://orcid.org/0000-0003-1016-3383"},"institutions":[{"id":"https://openalex.org/I114112103","display_name":"Leibniz University Hannover","ror":"https://ror.org/0304hq317","country_code":"DE","type":"education","lineage":["https://openalex.org/I114112103"]}],"countries":["DE"],"is_corresponding":true,"raw_author_name":"Michael Cuntz","raw_affiliation_strings":["Institut f\u00fcr Algebra, Zahlentheorie und Diskrete Mathematik, Fakult\u00e4t f\u00fcr Mathematik und Physik, Leibniz Universit\u00e4t Hannover, Welfengarten 1, 30167, Hanover, Germany"],"raw_orcid":"https://orcid.org/0000-0003-1016-3383","affiliations":[{"raw_affiliation_string":"Institut f\u00fcr Algebra, Zahlentheorie und Diskrete Mathematik, Fakult\u00e4t f\u00fcr Mathematik und Physik, Leibniz Universit\u00e4t Hannover, Welfengarten 1, 30167, Hanover, Germany","institution_ids":["https://openalex.org/I114112103"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5082130619"],"corresponding_institution_ids":["https://openalex.org/I114112103"],"apc_list":{"value":2290,"currency":"EUR","value_usd":2890},"apc_paid":{"value":2290,"currency":"EUR","value_usd":2890},"fwci":4.4104,"has_fulltext":true,"cited_by_count":8,"citation_normalized_percentile":{"value":0.9444791,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":89,"max":97},"biblio":{"volume":"68","issue":"1","first_page":"107","last_page":"124"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10948","display_name":"Advanced Combinatorial Mathematics","score":0.9998999834060669,"subfield":{"id":"https://openalex.org/subfields/2607","display_name":"Discrete Mathematics and Combinatorics"},"field":{"id":"https://openalex.org/fields/26","display_name":"Mathematics"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T10948","display_name":"Advanced Combinatorial Mathematics","score":0.9998999834060669,"subfield":{"id":"https://openalex.org/subfields/2607","display_name":"Discrete Mathematics and Combinatorics"},"field":{"id":"https://openalex.org/fields/26","display_name":"Mathematics"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10996","display_name":"Computational Geometry and Mesh Generation","score":0.9983999729156494,"subfield":{"id":"https://openalex.org/subfields/1704","display_name":"Computer Graphics and Computer-Aided Design"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T11797","display_name":"graph theory and CDMA systems","score":0.9976000189781189,"subfield":{"id":"https://openalex.org/subfields/2208","display_name":"Electrical and Electronic Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/matroid","display_name":"Matroid","score":0.888583779335022},{"id":"https://openalex.org/keywords/hyperplane","display_name":"Hyperplane","score":0.7638188600540161},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.7183650732040405},{"id":"https://openalex.org/keywords/simplicial-complex","display_name":"Simplicial complex","score":0.7002385854721069},{"id":"https://openalex.org/keywords/abstract-simplicial-complex","display_name":"Abstract simplicial complex","score":0.6805890202522278},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.6346704959869385},{"id":"https://openalex.org/keywords/h-vector","display_name":"h-vector","score":0.6111184358596802},{"id":"https://openalex.org/keywords/simplicial-approximation-theorem","display_name":"Simplicial approximation theorem","score":0.6050004959106445},{"id":"https://openalex.org/keywords/simplicial-manifold","display_name":"Simplicial manifold","score":0.6004798412322998},{"id":"https://openalex.org/keywords/greedy-algorithm","display_name":"Greedy algorithm","score":0.582936704158783},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.3497203290462494},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.29565155506134033},{"id":"https://openalex.org/keywords/pure-mathematics","display_name":"Pure mathematics","score":0.16715732216835022},{"id":"https://openalex.org/keywords/simplicial-set","display_name":"Simplicial set","score":0.147477924823761}],"concepts":[{"id":"https://openalex.org/C106286213","wikidata":"https://www.wikidata.org/wiki/Q898572","display_name":"Matroid","level":2,"score":0.888583779335022},{"id":"https://openalex.org/C68693459","wikidata":"https://www.wikidata.org/wiki/Q657586","display_name":"Hyperplane","level":2,"score":0.7638188600540161},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.7183650732040405},{"id":"https://openalex.org/C187929450","wikidata":"https://www.wikidata.org/wiki/Q994399","display_name":"Simplicial complex","level":2,"score":0.7002385854721069},{"id":"https://openalex.org/C146867743","wikidata":"https://www.wikidata.org/wiki/Q4669959","display_name":"Abstract simplicial complex","level":3,"score":0.6805890202522278},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.6346704959869385},{"id":"https://openalex.org/C127634017","wikidata":"https://www.wikidata.org/wiki/Q5627866","display_name":"h-vector","level":3,"score":0.6111184358596802},{"id":"https://openalex.org/C64245159","wikidata":"https://www.wikidata.org/wiki/Q3983972","display_name":"Simplicial approximation theorem","level":5,"score":0.6050004959106445},{"id":"https://openalex.org/C97172818","wikidata":"https://www.wikidata.org/wiki/Q7520904","display_name":"Simplicial manifold","level":5,"score":0.6004798412322998},{"id":"https://openalex.org/C51823790","wikidata":"https://www.wikidata.org/wiki/Q504353","display_name":"Greedy algorithm","level":2,"score":0.582936704158783},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.3497203290462494},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.29565155506134033},{"id":"https://openalex.org/C202444582","wikidata":"https://www.wikidata.org/wiki/Q837863","display_name":"Pure mathematics","level":1,"score":0.16715732216835022},{"id":"https://openalex.org/C155366967","wikidata":"https://www.wikidata.org/wiki/Q1467124","display_name":"Simplicial set","level":4,"score":0.147477924823761},{"id":"https://openalex.org/C5961521","wikidata":"https://www.wikidata.org/wiki/Q746083","display_name":"Homotopy","level":2,"score":0.0},{"id":"https://openalex.org/C79236096","wikidata":"https://www.wikidata.org/wiki/Q14775269","display_name":"Homotopy category","level":3,"score":0.0}],"mesh":[],"locations_count":3,"locations":[{"id":"doi:10.1007/s00454-021-00351-y","is_oa":true,"landing_page_url":"https://doi.org/10.1007/s00454-021-00351-y","pdf_url":"https://link.springer.com/content/pdf/10.1007/s00454-021-00351-y.pdf","source":{"id":"https://openalex.org/S103671469","display_name":"Discrete & Computational Geometry","issn_l":"0179-5376","issn":["0179-5376","1432-0444"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319900","host_organization_name":"Springer Science+Business Media","host_organization_lineage":["https://openalex.org/P4310319900","https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Science+Business Media","Springer Nature"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Discrete & Computational Geometry","raw_type":"journal-article"},{"id":"pmh:oai:www.repo.uni-hannover.de:123456789/13027","is_oa":true,"landing_page_url":"https://www.repo.uni-hannover.de/handle/123456789/13027","pdf_url":null,"source":{"id":"https://openalex.org/S4306401575","display_name":"Institutional Repository of Leibniz Universit\u00e4t Hannover (Leibniz Universit\u00e4t Hannover)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I114112103","host_organization_name":"Leibniz University Hannover","host_organization_lineage":["https://openalex.org/I114112103"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by-nc-nd","license_id":"https://openalex.org/licenses/cc-by-nc-nd","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Discrete & computational geometry : an international journal of mathematics and computer science 68 (2022), Nr. 1","raw_type":"info:eu-repo/semantics/publishedVersion"},{"id":"doi:10.15488/12923","is_oa":true,"landing_page_url":"https://doi.org/10.15488/12923","pdf_url":null,"source":{"id":"https://openalex.org/S7407052956","display_name":"Leibniz Universit\u00e4t Hannover","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":null,"is_accepted":false,"is_published":null,"raw_source_name":null,"raw_type":"article-journal"}],"best_oa_location":{"id":"doi:10.1007/s00454-021-00351-y","is_oa":true,"landing_page_url":"https://doi.org/10.1007/s00454-021-00351-y","pdf_url":"https://link.springer.com/content/pdf/10.1007/s00454-021-00351-y.pdf","source":{"id":"https://openalex.org/S103671469","display_name":"Discrete & Computational Geometry","issn_l":"0179-5376","issn":["0179-5376","1432-0444"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319900","host_organization_name":"Springer Science+Business Media","host_organization_lineage":["https://openalex.org/P4310319900","https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Science+Business Media","Springer Nature"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Discrete & Computational Geometry","raw_type":"journal-article"},"sustainable_development_goals":[{"id":"https://metadata.un.org/sdg/11","display_name":"Sustainable cities and communities","score":0.5600000023841858}],"awards":[{"id":"https://openalex.org/G4137954395","display_name":"Parallelrechner","funder_award_id":"411116428","funder_id":"https://openalex.org/F4320320879","funder_display_name":"Deutsche Forschungsgemeinschaft"}],"funders":[{"id":"https://openalex.org/F4320320879","display_name":"Deutsche Forschungsgemeinschaft","ror":"https://ror.org/018mejw64"},{"id":"https://openalex.org/F4320322379","display_name":"Gottfried Wilhelm Leibniz Universit\u00e4t Hannover","ror":"https://ror.org/0304hq317"}],"has_content":{"pdf":true,"grobid_xml":true},"content_urls":{"pdf":"https://content.openalex.org/works/W3037212754.pdf","grobid_xml":"https://content.openalex.org/works/W3037212754.grobid-xml"},"referenced_works_count":19,"referenced_works":["https://openalex.org/W377884864","https://openalex.org/W1820867527","https://openalex.org/W1982284001","https://openalex.org/W1993670376","https://openalex.org/W1998309758","https://openalex.org/W2006298996","https://openalex.org/W2031939871","https://openalex.org/W2053849387","https://openalex.org/W2085821474","https://openalex.org/W2224841798","https://openalex.org/W2774621083","https://openalex.org/W2806924249","https://openalex.org/W2962831060","https://openalex.org/W2963772909","https://openalex.org/W2964105858","https://openalex.org/W2964107508","https://openalex.org/W2964184865","https://openalex.org/W2971330320","https://openalex.org/W3103974738"],"related_works":["https://openalex.org/W4288359443","https://openalex.org/W2969857904","https://openalex.org/W2943582562","https://openalex.org/W401177922","https://openalex.org/W2149807338","https://openalex.org/W2962940227","https://openalex.org/W230527091","https://openalex.org/W2399269288","https://openalex.org/W2899237853","https://openalex.org/W2963536907"],"abstract_inverted_index":{"Abstract":[0],"We":[1,15,48],"introduce":[2],"a":[3,13,33,40,50],"greedy":[4],"algorithm":[5,18],"optimizing":[6],"arrangements":[7,29,58],"of":[8,22,30,54,59,77],"lines":[9,31],"with":[10,45,61],"respect":[11],"to":[12,19,63,80],"property.":[14],"apply":[16],"this":[17],"the":[20],"case":[21],"simpliciality:":[23],"it":[24,67],"recovers":[25],"all":[26],"known":[27],"simplicial":[28,43,56],"in":[32],"very":[34],"short":[35],"time":[36],"and":[37],"also":[38],"produces":[39],"yet":[41],"unknown":[42],"arrangement":[44],"35":[46],"lines.":[47,65],"compute":[49],"(certainly":[51],"incomplete)":[52],"database":[53],"combinatorially":[55],"complex":[57],"hyperplanes":[60],"up":[62,79],"50":[64],"Surprisingly,":[66],"contains":[68],"several":[69],"examples":[70],"whose":[71],"matroids":[72],"have":[73],"an":[74],"infinite":[75],"space":[76],"realizations":[78],"projectivities.":[81]},"counts_by_year":[{"year":2025,"cited_by_count":1},{"year":2024,"cited_by_count":1},{"year":2023,"cited_by_count":3},{"year":2022,"cited_by_count":1},{"year":2021,"cited_by_count":2}],"updated_date":"2026-05-21T06:26:12.895304","created_date":"2025-10-10T00:00:00"}