{"id":"https://openalex.org/W6888428011","doi":"https://doi.org/10.20382/jocg.v16i1a7","title":"Simplification of polyline bundles of graphs and trees","display_name":"Simplification of polyline bundles of graphs and trees","publication_year":2023,"publication_date":"2023-01-31","ids":{"openalex":"https://openalex.org/W6888428011","doi":"https://doi.org/10.20382/jocg.v16i1a7"},"language":"en","primary_location":{"id":"pmh:oai:ojs.library.carleton.ca:article/4106","is_oa":true,"landing_page_url":"https://jocg.org/index.php/jocg/article/view/4106","pdf_url":null,"source":{"id":"https://openalex.org/S4306400962","display_name":"Journal of Computational Geometry (Carleton University)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I67031392","host_organization_name":"Carleton University","host_organization_lineage":["https://openalex.org/I67031392"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"10.20382/jocg.v16i1","raw_type":"info:eu-repo/semantics/article"},"type":"article","indexed_in":["datacite","doaj"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://jocg.org/index.php/jocg/article/view/4106","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":null,"display_name":"Bosch, Yannick","orcid":"https://orcid.org/0009-0005-8517-9226"},"institutions":[{"id":"https://openalex.org/I189712700","display_name":"University of Konstanz","ror":"https://ror.org/0546hnb39","country_code":"DE","type":"education","lineage":["https://openalex.org/I189712700"]}],"countries":["DE"],"is_corresponding":false,"raw_author_name":"Bosch, Yannick","raw_affiliation_strings":["University of Konstanz"],"raw_orcid":"https://orcid.org/0009-0005-8517-9226","affiliations":[{"raw_affiliation_string":"University of Konstanz","institution_ids":["https://openalex.org/I189712700"]}]},{"author_position":"middle","author":{"id":null,"display_name":"Sch\u00e4fer, Peter","orcid":null},"institutions":[{"id":"https://openalex.org/I189712700","display_name":"University of Konstanz","ror":"https://ror.org/0546hnb39","country_code":"DE","type":"education","lineage":["https://openalex.org/I189712700"]}],"countries":["DE"],"is_corresponding":false,"raw_author_name":"Sch\u00e4fer, Peter","raw_affiliation_strings":["University of Konstanz"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"University of Konstanz","institution_ids":["https://openalex.org/I189712700"]}]},{"author_position":"middle","author":{"id":null,"display_name":"Spoerhase, Joachim","orcid":"https://orcid.org/0000-0002-2601-6452"},"institutions":[{"id":"https://openalex.org/I146655781","display_name":"University of Liverpool","ror":"https://ror.org/04xs57h96","country_code":"GB","type":"education","lineage":["https://openalex.org/I146655781"]}],"countries":["GB"],"is_corresponding":false,"raw_author_name":"Spoerhase, Joachim","raw_affiliation_strings":["University of Liverpool"],"raw_orcid":"https://orcid.org/0000-0002-2601-6452","affiliations":[{"raw_affiliation_string":"University of Liverpool","institution_ids":["https://openalex.org/I146655781"]}]},{"author_position":"middle","author":{"id":null,"display_name":"Storandt, Sabine","orcid":"https://orcid.org/0000-0001-5411-3834"},"institutions":[{"id":"https://openalex.org/I189712700","display_name":"University of Konstanz","ror":"https://ror.org/0546hnb39","country_code":"DE","type":"education","lineage":["https://openalex.org/I189712700"]}],"countries":["DE"],"is_corresponding":false,"raw_author_name":"Storandt, Sabine","raw_affiliation_strings":["University of Konstanz"],"raw_orcid":"https://orcid.org/0000-0001-5411-3834","affiliations":[{"raw_affiliation_string":"University of Konstanz","institution_ids":["https://openalex.org/I189712700"]}]},{"author_position":"last","author":{"id":null,"display_name":"Zink, Johannes","orcid":"https://orcid.org/0000-0002-7398-718X"},"institutions":[{"id":"https://openalex.org/I41121874","display_name":"Heilbronn University","ror":"https://ror.org/04g5gcg95","country_code":"DE","type":"education","lineage":["https://openalex.org/I41121874"]}],"countries":["DE"],"is_corresponding":false,"raw_author_name":"Zink, Johannes","raw_affiliation_strings":["University of Wu\u0308rzburg and Technical University of Munich, Heilbronn"],"raw_orcid":"https://orcid.org/0000-0002-7398-718X","affiliations":[{"raw_affiliation_string":"University of Wu\u0308rzburg and Technical University of Munich, Heilbronn","institution_ids":["https://openalex.org/I41121874"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":3,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":{"value":0.54623753,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":null,"last_page":null},"is_retracted":false,"is_paratext":false,"is_xpac":true,"primary_topic":{"id":"https://openalex.org/T10996","display_name":"Computational Geometry and Mesh Generation","score":0.25589999556541443,"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.25589999556541443,"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/T10374","display_name":"Advanced Graph Theory Research","score":0.2362000048160553,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"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.12330000102519989,"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/bundle","display_name":"Bundle","score":0.6740999817848206},{"id":"https://openalex.org/keywords/line-segment","display_name":"Line segment","score":0.6011000275611877},{"id":"https://openalex.org/keywords/vertex","display_name":"Vertex (graph theory)","score":0.58160001039505},{"id":"https://openalex.org/keywords/generalization","display_name":"Generalization","score":0.4514999985694885},{"id":"https://openalex.org/keywords/path","display_name":"Path (computing)","score":0.4390999972820282},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.43389999866485596},{"id":"https://openalex.org/keywords/hausdorff-distance","display_name":"Hausdorff distance","score":0.3955000042915344}],"concepts":[{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.743399977684021},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.7215999960899353},{"id":"https://openalex.org/C2778134712","wikidata":"https://www.wikidata.org/wiki/Q1047307","display_name":"Bundle","level":2,"score":0.6740999817848206},{"id":"https://openalex.org/C182124507","wikidata":"https://www.wikidata.org/wiki/Q166154","display_name":"Line segment","level":2,"score":0.6011000275611877},{"id":"https://openalex.org/C80899671","wikidata":"https://www.wikidata.org/wiki/Q1304193","display_name":"Vertex (graph theory)","level":3,"score":0.58160001039505},{"id":"https://openalex.org/C177148314","wikidata":"https://www.wikidata.org/wiki/Q170084","display_name":"Generalization","level":2,"score":0.4514999985694885},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.4390999972820282},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.43389999866485596},{"id":"https://openalex.org/C141898687","wikidata":"https://www.wikidata.org/wiki/Q1501997","display_name":"Hausdorff distance","level":2,"score":0.3955000042915344},{"id":"https://openalex.org/C62354387","wikidata":"https://www.wikidata.org/wiki/Q875399","display_name":"Boundary (topology)","level":2,"score":0.37389999628067017},{"id":"https://openalex.org/C198352243","wikidata":"https://www.wikidata.org/wiki/Q37105","display_name":"Line (geometry)","level":2,"score":0.37299999594688416},{"id":"https://openalex.org/C2776436953","wikidata":"https://www.wikidata.org/wiki/Q5163215","display_name":"Consistency (knowledge bases)","level":2,"score":0.3328999876976013},{"id":"https://openalex.org/C45340560","wikidata":"https://www.wikidata.org/wiki/Q215382","display_name":"Disjoint sets","level":2,"score":0.3278999924659729},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.3176000118255615},{"id":"https://openalex.org/C113174947","wikidata":"https://www.wikidata.org/wiki/Q2859736","display_name":"Tree (set theory)","level":2,"score":0.29820001125335693},{"id":"https://openalex.org/C162307627","wikidata":"https://www.wikidata.org/wiki/Q204833","display_name":"Enhanced Data Rates for GSM Evolution","level":2,"score":0.28279998898506165},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.263700008392334},{"id":"https://openalex.org/C101837359","wikidata":"https://www.wikidata.org/wiki/Q547823","display_name":"Planar graph","level":3,"score":0.2529999911785126}],"mesh":[],"locations_count":4,"locations":[{"id":"pmh:oai:ojs.library.carleton.ca:article/4106","is_oa":true,"landing_page_url":"https://jocg.org/index.php/jocg/article/view/4106","pdf_url":null,"source":{"id":"https://openalex.org/S4306400962","display_name":"Journal of Computational Geometry (Carleton University)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I67031392","host_organization_name":"Carleton University","host_organization_lineage":["https://openalex.org/I67031392"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"10.20382/jocg.v16i1","raw_type":"info:eu-repo/semantics/article"},{"id":"pmh:oai:doaj.org/article:ab6936af31d442b7958a624df2ab5bdd","is_oa":true,"landing_page_url":"https://doaj.org/article/ab6936af31d442b7958a624df2ab5bdd","pdf_url":null,"source":{"id":"https://openalex.org/S4306401280","display_name":"DOAJ (DOAJ: Directory of Open Access Journals)","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-sa","license_id":"https://openalex.org/licenses/cc-by-sa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Journal of Computational Geometry, Vol 16, Iss 1 (2025)","raw_type":"article"},{"id":"pmh:oai:kops.uni-konstanz.de:123456789/73050","is_oa":false,"landing_page_url":"http://nbn-resolving.de/urn:nbn:de:bsz:352-2-1lo5jn58xoy418","pdf_url":null,"source":{"id":"https://openalex.org/S4306401487","display_name":"KOPS (University of Konstanz)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I189712700","host_organization_name":"University of Konstanz","host_organization_lineage":["https://openalex.org/I189712700"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Journal of Computational Geometry. Carleton University. 2025, 16(1), S. 203-252. eISSN 1920-180X. Verf\u00fcgbar unter: doi: 10.20382/jocg.v16i1a7","raw_type":"doc-type:article"},{"id":"doi:10.20382/jocg.v16i1a7","is_oa":true,"landing_page_url":"https://doi.org/10.20382/jocg.v16i1a7","pdf_url":null,"source":{"id":"https://openalex.org/S4306400962","display_name":"Journal of Computational Geometry (Carleton University)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I67031392","host_organization_name":"Carleton University","host_organization_lineage":["https://openalex.org/I67031392"],"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":"JournalArticle"}],"best_oa_location":{"id":"pmh:oai:ojs.library.carleton.ca:article/4106","is_oa":true,"landing_page_url":"https://jocg.org/index.php/jocg/article/view/4106","pdf_url":null,"source":{"id":"https://openalex.org/S4306400962","display_name":"Journal of Computational Geometry (Carleton University)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I67031392","host_organization_name":"Carleton University","host_organization_lineage":["https://openalex.org/I67031392"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"10.20382/jocg.v16i1","raw_type":"info:eu-repo/semantics/article"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":0,"referenced_works":[],"related_works":[],"abstract_inverted_index":{"Polyline":[0],"simplification":[1,43,303],"is":[2,75,119,149,159,181,197,305],"a":[3,9,16,38,47,53,68,70,82,88,110,116,186,238,262,273,314,320],"well-studied":[4],"optimization":[5],"problem,":[6],"in":[7,124,145,202,266,287,307,309,367,399],"which":[8,21,330],"given":[10,52,83,111],"polyline":[11,17,29,42,71,79,84,129,147,173,204,275,302,394],"shall":[12],"be":[13,259,333],"replaced":[14],"by":[15,86,261],"with":[18,217,277,291],"fewer":[19],"vertices":[20,92,144,201,286],"still":[22],"represents":[23],"the":[24,27,41,96,128,140,146,169,198,203,224,227,230,233,252,267,301,311,344,347,352,369,374,382],"shape":[25],"of":[26,40,46,55,81,90,127,142,172,188,200,226,232,264,346],"original":[28],"faithfully.":[30],"In":[31,244,296,338],"this":[32,134,153,179,241],"paper,":[33],"we":[34,50,155,176,222,246,250,270,298,342],"propose":[35],"and":[36,63,103,138,164,213,255,336,351,361,389],"study":[37],"generalization":[39],"problem.":[44],"Instead":[45],"single":[48],"polyline,":[49],"are":[51],"set":[54,69],"$\\ell$":[56],"polylines":[57,126,312,370],"possibly":[58],"sharing":[59],"some":[60],"line":[61],"segments":[62],"vertices.":[64],"We":[65,317,364],"call":[66],"such":[67,93],"bundle.":[72,205],"The":[73],"task":[74],"to":[76,133,161,183,210,215,229,258],"simplify":[77],"each":[78],"$L$":[80,102],"bundle":[85,130,148,174,276,354,384],"keeping":[87],"subset":[89],"its":[91,104],"that":[94,157,178,248,300,323,366],"(i)":[95],"Hausdorff":[97],"or":[98,122],"Fre\u0301chet":[99,253],"distance":[100,112,234,254],"between":[101],"simplified":[105,274,334],"counterpart":[106],"does":[107],"not":[108],"exceed":[109],"threshold":[113,235],"$\\delta$,":[114],"(ii)":[115],"shared":[117],"vertex":[118],"either":[120],"kept":[121,143],"discarded":[123],"all":[125],"(we":[131],"refer":[132],"requirement":[135],"as":[136,237],"consistency)":[137],"(iii)":[139],"number":[141,199],"minimized.":[150],"To":[151],"justify":[152],"definition,":[154],"argue":[156],"consistency":[158],"crucial":[160],"get":[162],"meaningful":[163],"aesthetically":[165],"pleasing":[166],"outputs.":[167],"Regarding":[168],"computational":[170],"complexity":[171],"simplification,":[175],"prove":[177,247],"problem":[180,304],"NP-hard":[182],"approximate":[184],"within":[185],"factor":[187,263],"$n^{1/3\u2212\\varepsilon}$":[189],"for":[190,240],"any":[191],"$\\varepsilon":[192],">":[193],"0$,":[194],"where":[195],"$n$":[196],"This":[206],"inapproximability":[207],"even":[208],"applies":[209],"planar":[211],"inputs":[212],"also":[214],"instances":[216],"only":[218],"$\\ell=2$":[219],"polylines.":[220],"However,":[221],"identify":[223],"sensitivity":[225],"solution":[228],"choice":[231],"$\\delta$":[236,257],"reason":[239],"strong":[242],"inapproximability.":[243],"particular,":[245],"if":[249],"employ":[251],"allow":[256],"exceeded":[260],"$2$":[265],"solution,":[268],"then":[269,331],"can":[271,332],"find":[272],"no":[278],"more":[279],"than":[280],"$O(\\log(\\ell":[281],"+":[282],"n))":[283],"\\cdot":[284],"\\mathrm{OPT}$":[285],"polytime,":[288],"providing":[289],"us":[290],"an":[292],"efficient":[293],"bi-criteria":[294,348,375],"approximation.":[295],"addition,":[297],"show":[299,365],"solvable":[306],"polytime":[308],"case":[310,368],"form":[313,371],"rooted":[315],"tree.":[316],"further":[318],"present":[319],"greedy":[321],"heuristic":[322],"decomposes":[324],"general":[325],"bundles":[326,395],"into":[327],"tree":[328,353,383],"bundles,":[329],"individually":[335],"optimally.":[337],"our":[339],"experimental":[340],"study,":[341],"compare":[343],"performance":[345],"approximation":[349,376],"algorithm":[350,356,377,386],"decomposition":[355,385],"on":[357,393],"public":[358],"transit":[359],"networks":[360],"movement":[362],"trajectories.":[363],"grid-like":[372],"structures,":[373],"outputs":[378],"smaller":[379],"simplifications,":[380],"but":[381],"scales":[387],"better":[388],"produces":[390],"superior":[391],"results":[392],"derived":[396],"from":[397],"paths":[398],"embedded":[400],"road":[401],"networks.":[402]},"counts_by_year":[],"updated_date":"2026-07-01T06:00:48.157686","created_date":"2025-10-10T00:00:00"}