{"id":"https://openalex.org/W2971168062","doi":"https://doi.org/10.1137/1.9781611975055.12","title":"A Geometric Heuristic for Rectilinear Crossing Minimization","display_name":"A Geometric Heuristic for Rectilinear Crossing Minimization","publication_year":2018,"publication_date":"2018-01-01","ids":{"openalex":"https://openalex.org/W2971168062","doi":"https://doi.org/10.1137/1.9781611975055.12","mag":"2971168062"},"language":"en","primary_location":{"id":"doi:10.1137/1.9781611975055.12","is_oa":true,"landing_page_url":"https://doi.org/10.1137/1.9781611975055.12","pdf_url":"https://epubs.siam.org/doi/pdf/10.1137/1.9781611975055.12","source":{"id":"https://openalex.org/S4306463922","display_name":"Society for Industrial and Applied Mathematics eBooks","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/P4310320508","host_organization_name":"Society for Industrial and Applied Mathematics","host_organization_lineage":["https://openalex.org/P4310320508"],"host_organization_lineage_names":["Society for Industrial and Applied Mathematics"],"type":"ebook platform"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2018 Proceedings of the Twentieth Workshop on Algorithm Engineering and Experiments (ALENEX)","raw_type":"book-chapter"},"type":"book-chapter","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"bronze","oa_url":"https://epubs.siam.org/doi/pdf/10.1137/1.9781611975055.12","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5014484000","display_name":"Marcel Radermacher","orcid":"https://orcid.org/0000-0002-7661-0767"},"institutions":[{"id":"https://openalex.org/I102335020","display_name":"Karlsruhe Institute of Technology","ror":"https://ror.org/04t3en479","country_code":"DE","type":"education","lineage":["https://openalex.org/I102335020","https://openalex.org/I1305996414"]}],"countries":["DE"],"is_corresponding":true,"raw_author_name":"Marcel Radermacher","raw_affiliation_strings":["Department of Computer Science, Karlsruhe Institute of Technology ,Germany,"],"affiliations":[{"raw_affiliation_string":"Department of Computer Science, Karlsruhe Institute of Technology ,Germany,","institution_ids":["https://openalex.org/I102335020"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5003564228","display_name":"Klara Reichard","orcid":null},"institutions":[{"id":"https://openalex.org/I8087733","display_name":"University of T\u00fcbingen","ror":"https://ror.org/03a1kwz48","country_code":"DE","type":"education","lineage":["https://openalex.org/I8087733"]},{"id":"https://openalex.org/I4210099593","display_name":"Computer Algorithms for Medicine","ror":"https://ror.org/00zky6d38","country_code":"AT","type":"facility","lineage":["https://openalex.org/I4210099593"]}],"countries":["AT","DE"],"is_corresponding":false,"raw_author_name":"Klara Reichard","raw_affiliation_strings":["Department of Algorithms in Bioinformatics, Universitt Tbingen, Tbingen, Germany,","Department of Algorithms in Bioinformatics, Universit\u00e4t T\u00fcbingen, T\u00fcbingen, Germany,"],"affiliations":[{"raw_affiliation_string":"Department of Algorithms in Bioinformatics, Universitt Tbingen, Tbingen, Germany,","institution_ids":["https://openalex.org/I4210099593"]},{"raw_affiliation_string":"Department of Algorithms in Bioinformatics, Universit\u00e4t T\u00fcbingen, T\u00fcbingen, Germany,","institution_ids":["https://openalex.org/I8087733"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5036986694","display_name":"Ignaz Rutter","orcid":"https://orcid.org/0000-0002-3794-4406"},"institutions":[{"id":"https://openalex.org/I83019370","display_name":"Eindhoven University of Technology","ror":"https://ror.org/02c2kyt77","country_code":"NL","type":"education","lineage":["https://openalex.org/I83019370"]}],"countries":["NL"],"is_corresponding":false,"raw_author_name":"Ignaz Rutter","raw_affiliation_strings":["Department of Mathematics and Computer Science, TU Eindhoven, The Netherlands,"],"affiliations":[{"raw_affiliation_string":"Department of Mathematics and Computer Science, TU Eindhoven, The Netherlands,","institution_ids":["https://openalex.org/I83019370"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5045460793","display_name":"Dorothea Wagner","orcid":"https://orcid.org/0000-0002-9141-7076"},"institutions":[{"id":"https://openalex.org/I102335020","display_name":"Karlsruhe Institute of Technology","ror":"https://ror.org/04t3en479","country_code":"DE","type":"education","lineage":["https://openalex.org/I102335020","https://openalex.org/I1305996414"]}],"countries":["DE"],"is_corresponding":false,"raw_author_name":"Dorothea Wagner","raw_affiliation_strings":["Department of Computer Science, Karlsruhe Institute of Technology ,Germany,"],"affiliations":[{"raw_affiliation_string":"Department of Computer Science, Karlsruhe Institute of Technology ,Germany,","institution_ids":["https://openalex.org/I102335020"]}]}],"institutions":[],"countries_distinct_count":3,"institutions_distinct_count":4,"corresponding_author_ids":["https://openalex.org/A5014484000"],"corresponding_institution_ids":["https://openalex.org/I102335020"],"apc_list":null,"apc_paid":null,"fwci":6.3258,"has_fulltext":true,"cited_by_count":13,"citation_normalized_percentile":{"value":0.98042169,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":90,"max":98},"biblio":{"volume":null,"issue":null,"first_page":"129","last_page":"138"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10996","display_name":"Computational Geometry and Mesh Generation","score":0.9975000023841858,"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"}},"topics":[{"id":"https://openalex.org/T10996","display_name":"Computational Geometry and Mesh Generation","score":0.9975000023841858,"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/T11106","display_name":"Data Management and Algorithms","score":0.9911999702453613,"subfield":{"id":"https://openalex.org/subfields/1711","display_name":"Signal Processing"},"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/T10799","display_name":"Data Visualization and Analytics","score":0.9897000193595886,"subfield":{"id":"https://openalex.org/subfields/1707","display_name":"Computer Vision and Pattern Recognition"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/heuristics","display_name":"Heuristics","score":0.8303879499435425},{"id":"https://openalex.org/keywords/minification","display_name":"Minification","score":0.6739599704742432},{"id":"https://openalex.org/keywords/vertex","display_name":"Vertex (graph theory)","score":0.614726722240448},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.5572272539138794},{"id":"https://openalex.org/keywords/crossing-number","display_name":"Crossing number (knot theory)","score":0.5408698916435242},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.49956202507019043},{"id":"https://openalex.org/keywords/heuristic","display_name":"Heuristic","score":0.4984281063079834},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.48789143562316895},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.4527561366558075},{"id":"https://openalex.org/keywords/line-segment","display_name":"Line segment","score":0.43595242500305176},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.3919319808483124},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.3308046758174896},{"id":"https://openalex.org/keywords/geometry","display_name":"Geometry","score":0.26385772228240967},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.2175786793231964},{"id":"https://openalex.org/keywords/engineering","display_name":"Engineering","score":0.08428898453712463},{"id":"https://openalex.org/keywords/intersection","display_name":"Intersection (aeronautics)","score":0.07144531607627869}],"concepts":[{"id":"https://openalex.org/C127705205","wikidata":"https://www.wikidata.org/wiki/Q5748245","display_name":"Heuristics","level":2,"score":0.8303879499435425},{"id":"https://openalex.org/C147764199","wikidata":"https://www.wikidata.org/wiki/Q6865248","display_name":"Minification","level":2,"score":0.6739599704742432},{"id":"https://openalex.org/C80899671","wikidata":"https://www.wikidata.org/wiki/Q1304193","display_name":"Vertex (graph theory)","level":3,"score":0.614726722240448},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.5572272539138794},{"id":"https://openalex.org/C2777724877","wikidata":"https://www.wikidata.org/wiki/Q2548661","display_name":"Crossing number (knot theory)","level":3,"score":0.5408698916435242},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.49956202507019043},{"id":"https://openalex.org/C173801870","wikidata":"https://www.wikidata.org/wiki/Q201413","display_name":"Heuristic","level":2,"score":0.4984281063079834},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.48789143562316895},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.4527561366558075},{"id":"https://openalex.org/C182124507","wikidata":"https://www.wikidata.org/wiki/Q166154","display_name":"Line segment","level":2,"score":0.43595242500305176},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.3919319808483124},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.3308046758174896},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.26385772228240967},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.2175786793231964},{"id":"https://openalex.org/C127413603","wikidata":"https://www.wikidata.org/wiki/Q11023","display_name":"Engineering","level":0,"score":0.08428898453712463},{"id":"https://openalex.org/C64543145","wikidata":"https://www.wikidata.org/wiki/Q162942","display_name":"Intersection (aeronautics)","level":2,"score":0.07144531607627869},{"id":"https://openalex.org/C146978453","wikidata":"https://www.wikidata.org/wiki/Q3798668","display_name":"Aerospace engineering","level":1,"score":0.0}],"mesh":[],"locations_count":6,"locations":[{"id":"doi:10.1137/1.9781611975055.12","is_oa":true,"landing_page_url":"https://doi.org/10.1137/1.9781611975055.12","pdf_url":"https://epubs.siam.org/doi/pdf/10.1137/1.9781611975055.12","source":{"id":"https://openalex.org/S4306463922","display_name":"Society for Industrial and Applied Mathematics eBooks","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/P4310320508","host_organization_name":"Society for Industrial and Applied Mathematics","host_organization_lineage":["https://openalex.org/P4310320508"],"host_organization_lineage_names":["Society for Industrial and Applied Mathematics"],"type":"ebook platform"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2018 Proceedings of the Twentieth Workshop on Algorithm Engineering and Experiments (ALENEX)","raw_type":"book-chapter"},{"id":"pmh:oai:pure.tue.nl:openaire/aa60dd4d-415a-4be7-a6b5-968d3a32c4d7","is_oa":true,"landing_page_url":"https://research.tue.nl/en/publications/aa60dd4d-415a-4be7-a6b5-968d3a32c4d7","pdf_url":null,"source":{"id":"https://openalex.org/S4406922641","display_name":"TU/e Research Portal","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":"other-oa","license_id":"https://openalex.org/licenses/other-oa","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Radermacher, M, Reichard, K, Rutter, I & Wagner, D 2018, A geometric heuristic for rectilinear crossing minimization. in R Pagh & S Venkatasubramanian (eds), 2018 Proceedings of the 20th Workshop on Algorithm Engineering and Experiments, ALENEX 2018. Society for Industrial and Applied Mathematics (SIAM), pp. 129-138, 20th Workshop on Algorithm Engineering and Experiments (ALENEX 2018), New Orleans, Louisiana, United States, 7/01/18. https://doi.org/10.1137/1.9781611975055.12","raw_type":"info:eu-repo/semantics/publishedVersion"},{"id":"pmh:900708","is_oa":false,"landing_page_url":"http://library.tue.nl/csp/dare/LinkToRepository.csp?recordnumber=900708","pdf_url":null,"source":{"id":"https://openalex.org/S4406923046","display_name":"TU/e Research Portal (Eindhoven University of Technology)","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":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":""},{"id":"pmh:oai:gdea.informatik.uni-koeln.de:1637","is_oa":false,"landing_page_url":"http://gdea.informatik.uni-koeln.de/1637/","pdf_url":null,"source":{"id":"https://openalex.org/S4306400857","display_name":"Graph Drawing E-print Archive (Die Universit\u00e4t zu K\u00f6ln)","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":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":"Conference Poster"},{"id":"pmh:oai:library.tue.nl:900708","is_oa":false,"landing_page_url":"http://repository.tue.nl/900708","pdf_url":null,"source":{"id":"https://openalex.org/S4406923046","display_name":"TU/e Research Portal (Eindhoven University of Technology)","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":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":""},{"id":"pmh:tue:oai:pure.tue.nl:publications/aa60dd4d-415a-4be7-a6b5-968d3a32c4d7","is_oa":true,"landing_page_url":"https://research.tue.nl/nl/publications/aa60dd4d-415a-4be7-a6b5-968d3a32c4d7","pdf_url":null,"source":{"id":"https://openalex.org/S4306401843","display_name":"Data Archiving and Networked Services (DANS)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I1322597698","host_organization_name":"Royal Netherlands Academy of Arts and Sciences","host_organization_lineage":["https://openalex.org/I1322597698"],"host_organization_lineage_names":[],"type":"repository"},"license":"other-oa","license_id":"https://openalex.org/licenses/other-oa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"2018 Proceedings of the 20th Workshop on Algorithm Engineering and Experiments, ALENEX 2018, 129 - 138","raw_type":"info:eu-repo/semantics/conferencepaper"}],"best_oa_location":{"id":"doi:10.1137/1.9781611975055.12","is_oa":true,"landing_page_url":"https://doi.org/10.1137/1.9781611975055.12","pdf_url":"https://epubs.siam.org/doi/pdf/10.1137/1.9781611975055.12","source":{"id":"https://openalex.org/S4306463922","display_name":"Society for Industrial and Applied Mathematics eBooks","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/P4310320508","host_organization_name":"Society for Industrial and Applied Mathematics","host_organization_lineage":["https://openalex.org/P4310320508"],"host_organization_lineage_names":["Society for Industrial and Applied Mathematics"],"type":"ebook platform"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2018 Proceedings of the Twentieth Workshop on Algorithm Engineering and Experiments (ALENEX)","raw_type":"book-chapter"},"sustainable_development_goals":[{"id":"https://metadata.un.org/sdg/7","display_name":"Affordable and clean energy","score":0.44999998807907104}],"awards":[{"id":"https://openalex.org/G5682462959","display_name":null,"funder_award_id":"WA 654/21-1","funder_id":"https://openalex.org/F4320320879","funder_display_name":"Deutsche Forschungsgemeinschaft"},{"id":"https://openalex.org/G6052429835","display_name":null,"funder_award_id":"(DFG)","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"}],"has_content":{"pdf":true,"grobid_xml":true},"content_urls":{"pdf":"https://content.openalex.org/works/W2971168062.pdf","grobid_xml":"https://content.openalex.org/works/W2971168062.grobid-xml"},"referenced_works_count":37,"referenced_works":["https://openalex.org/W67348729","https://openalex.org/W149069588","https://openalex.org/W176071698","https://openalex.org/W634834491","https://openalex.org/W1479963486","https://openalex.org/W1504716054","https://openalex.org/W1509820354","https://openalex.org/W1546096271","https://openalex.org/W1570371166","https://openalex.org/W1874694348","https://openalex.org/W1987959163","https://openalex.org/W2004181701","https://openalex.org/W2009543464","https://openalex.org/W2012931553","https://openalex.org/W2021053884","https://openalex.org/W2023655578","https://openalex.org/W2045253938","https://openalex.org/W2060205664","https://openalex.org/W2060538865","https://openalex.org/W2096826541","https://openalex.org/W2131662609","https://openalex.org/W2139633313","https://openalex.org/W2167482691","https://openalex.org/W2262426677","https://openalex.org/W2403720295","https://openalex.org/W2441637932","https://openalex.org/W2569314284","https://openalex.org/W2951308222","https://openalex.org/W2963030908","https://openalex.org/W3136685299","https://openalex.org/W4293857795","https://openalex.org/W6602687376","https://openalex.org/W6628707120","https://openalex.org/W6665577251","https://openalex.org/W6670981819","https://openalex.org/W6718841353","https://openalex.org/W6980818637"],"related_works":["https://openalex.org/W2121875028","https://openalex.org/W2079123808","https://openalex.org/W1719252778","https://openalex.org/W1489167937","https://openalex.org/W2031098440","https://openalex.org/W4307385446","https://openalex.org/W4386875525","https://openalex.org/W2971168062","https://openalex.org/W4323924016","https://openalex.org/W2782195163"],"abstract_inverted_index":{"In":[0,133],"this":[1],"paper":[2],"we":[3,11,98,137],"consider":[4],"the":[5,59,79,92,113,116,123,130,153],"rectilinear":[6,60,71],"crossing":[7,72],"minimization":[8,32],"problem,":[9],"i.e.,":[10],"seek":[12],"a":[13,18,25,43,84,160,171],"straight-line":[14,143],"drawing":[15,94],"\u0413":[16],"of":[17,28,37,45,82,115,125,129,163,175],"graph":[19],"G":[20],"=":[21,177],"(V,":[22],"E)":[23],"with":[24,145,170],"small":[26],"number":[27],"edge":[29],"crossings.":[30],"Crossing":[31],"is":[33,42,112],"an":[34,100,134],"active":[35],"field":[36],"research":[38],"[1,9].":[39],"While":[40],"there":[41],"lot":[44],"work":[46],"on":[47,78,159],"heuristics":[48,69],"for":[49,70,96],"topological":[50],"drawings,":[51],"these":[52],"techniques":[53],"are":[54,76,122,168],"typically":[55],"not":[56],"transferable":[57],"to":[58,87],"(i.e.,":[61],"straight-line)":[62],"setting.":[63],"We":[64],"introduce":[65],"and":[66,118,120,127],"evaluate":[67],"three":[68],"minimization.":[73],"The":[74],"approaches":[75],"based":[77],"primitive":[80],"operation":[81],"moving":[83],"single":[85],"vertex":[86,117],"its":[88],"crossing-minimal":[89],"position":[90],"in":[91,152],"current":[93],"\u0393,":[95],"which":[97],"give":[99],"O":[101],"((kn":[102],"+":[103,107],"m)2":[104],"log":[105],"(kn":[106],"m))-time":[108],"algorithm,":[109],"where":[110],"k":[111],"degree":[114],"n":[119],"m":[121],"numbers":[124],"vertices":[126],"edges":[128],"graph,":[131],"respectively.":[132],"experimental":[135],"evaluation,":[136],"demonstrate":[138],"that":[139],"our":[140],"algorithms":[141,150],"compute":[142],"drawings":[144],"fewer":[146],"crossings":[147],"than":[148],"energy-based":[149],"implemented":[151],"Open":[154],"Graph":[155],"Drawing":[156],"Framework":[157],"[10]":[158],"varied":[161],"set":[162],"benchmark":[164],"instances.":[165],"All":[166],"experiments":[167],"evaluated":[169],"statistical":[172],"significance":[173],"level":[174],"\u03b1":[176],"0.05.":[178]},"counts_by_year":[{"year":2026,"cited_by_count":1},{"year":2025,"cited_by_count":1},{"year":2024,"cited_by_count":1},{"year":2022,"cited_by_count":2},{"year":2020,"cited_by_count":2},{"year":2019,"cited_by_count":4},{"year":2018,"cited_by_count":2}],"updated_date":"2026-04-10T15:06:20.359241","created_date":"2025-10-10T00:00:00"}