{"id":"https://openalex.org/W4309651784","doi":"https://doi.org/10.1145/3557915.3560987","title":"Gradual road network simplification with shape and topology preservation","display_name":"Gradual road network simplification with shape and topology preservation","publication_year":2022,"publication_date":"2022-11-01","ids":{"openalex":"https://openalex.org/W4309651784","doi":"https://doi.org/10.1145/3557915.3560987"},"language":"en","primary_location":{"id":"doi:10.1145/3557915.3560987","is_oa":false,"landing_page_url":"https://doi.org/10.1145/3557915.3560987","pdf_url":null,"source":{"id":"https://openalex.org/S4363608995","display_name":"Proceedings of the 30th International Conference on Advances in Geographic Information Systems","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":"conference"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 30th International Conference on Advances in Geographic Information Systems","raw_type":"proceedings-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":false,"oa_status":"closed","oa_url":null,"any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5038189924","display_name":"Lukas Baur","orcid":"https://orcid.org/0000-0002-6265-9877"},"institutions":[{"id":"https://openalex.org/I100066346","display_name":"University of Stuttgart","ror":"https://ror.org/04vnq7t77","country_code":"DE","type":"education","lineage":["https://openalex.org/I100066346"]}],"countries":["DE"],"is_corresponding":true,"raw_author_name":"Lukas Baur","raw_affiliation_strings":["University of Stuttgart, Stuttgart, Germany"],"affiliations":[{"raw_affiliation_string":"University of Stuttgart, Stuttgart, Germany","institution_ids":["https://openalex.org/I100066346"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5108747743","display_name":"Stefan Funke","orcid":null},"institutions":[{"id":"https://openalex.org/I100066346","display_name":"University of Stuttgart","ror":"https://ror.org/04vnq7t77","country_code":"DE","type":"education","lineage":["https://openalex.org/I100066346"]}],"countries":["DE"],"is_corresponding":false,"raw_author_name":"Stefan Funke","raw_affiliation_strings":["University of Stuttgart, Stuttgart, Germany"],"affiliations":[{"raw_affiliation_string":"University of Stuttgart, Stuttgart, Germany","institution_ids":["https://openalex.org/I100066346"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5037998552","display_name":"T. Rupp","orcid":"https://orcid.org/0000-0001-7502-7492"},"institutions":[{"id":"https://openalex.org/I100066346","display_name":"University of Stuttgart","ror":"https://ror.org/04vnq7t77","country_code":"DE","type":"education","lineage":["https://openalex.org/I100066346"]}],"countries":["DE"],"is_corresponding":false,"raw_author_name":"Tobias Rupp","raw_affiliation_strings":["University of Stuttgart, Stuttgart, Germany"],"affiliations":[{"raw_affiliation_string":"University of Stuttgart, Stuttgart, Germany","institution_ids":["https://openalex.org/I100066346"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5027517542","display_name":"Sabine Storandt","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":"Sabine Storandt","raw_affiliation_strings":["University of Konstanz, Konstanz, Germany"],"affiliations":[{"raw_affiliation_string":"University of Konstanz, Konstanz, Germany","institution_ids":["https://openalex.org/I189712700"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":4,"corresponding_author_ids":["https://openalex.org/A5038189924"],"corresponding_institution_ids":["https://openalex.org/I100066346"],"apc_list":null,"apc_paid":null,"fwci":1.5918,"has_fulltext":false,"cited_by_count":2,"citation_normalized_percentile":{"value":0.85806452,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":94,"max":96},"biblio":{"volume":null,"issue":null,"first_page":"1","last_page":"4"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10757","display_name":"Geographic Information Systems Studies","score":0.9987999796867371,"subfield":{"id":"https://openalex.org/subfields/3305","display_name":"Geography, Planning and Development"},"field":{"id":"https://openalex.org/fields/33","display_name":"Social Sciences"},"domain":{"id":"https://openalex.org/domains/2","display_name":"Social Sciences"}},"topics":[{"id":"https://openalex.org/T10757","display_name":"Geographic Information Systems Studies","score":0.9987999796867371,"subfield":{"id":"https://openalex.org/subfields/3305","display_name":"Geography, Planning and Development"},"field":{"id":"https://openalex.org/fields/33","display_name":"Social Sciences"},"domain":{"id":"https://openalex.org/domains/2","display_name":"Social Sciences"}},{"id":"https://openalex.org/T10799","display_name":"Data Visualization and Analytics","score":0.9958000183105469,"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"}},{"id":"https://openalex.org/T11106","display_name":"Data Management and Algorithms","score":0.989799976348877,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.7513514757156372},{"id":"https://openalex.org/keywords/rendering","display_name":"Rendering (computer graphics)","score":0.6858220100402832},{"id":"https://openalex.org/keywords/preprocessor","display_name":"Preprocessor","score":0.6152826547622681},{"id":"https://openalex.org/keywords/navigability","display_name":"Navigability","score":0.52541184425354},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.5179530382156372},{"id":"https://openalex.org/keywords/shortest-path-problem","display_name":"Shortest path problem","score":0.4496298134326935},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.4283148944377899},{"id":"https://openalex.org/keywords/topology","display_name":"Topology (electrical circuits)","score":0.4204745590686798},{"id":"https://openalex.org/keywords/data-mining","display_name":"Data mining","score":0.3818114101886749},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.36835354566574097},{"id":"https://openalex.org/keywords/distributed-computing","display_name":"Distributed computing","score":0.35054320096969604},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.2514667212963104},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.14715003967285156}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7513514757156372},{"id":"https://openalex.org/C205711294","wikidata":"https://www.wikidata.org/wiki/Q176953","display_name":"Rendering (computer graphics)","level":2,"score":0.6858220100402832},{"id":"https://openalex.org/C34736171","wikidata":"https://www.wikidata.org/wiki/Q918333","display_name":"Preprocessor","level":2,"score":0.6152826547622681},{"id":"https://openalex.org/C2778972660","wikidata":"https://www.wikidata.org/wiki/Q1666353","display_name":"Navigability","level":2,"score":0.52541184425354},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.5179530382156372},{"id":"https://openalex.org/C22590252","wikidata":"https://www.wikidata.org/wiki/Q1058754","display_name":"Shortest path problem","level":3,"score":0.4496298134326935},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.4283148944377899},{"id":"https://openalex.org/C184720557","wikidata":"https://www.wikidata.org/wiki/Q7825049","display_name":"Topology (electrical circuits)","level":2,"score":0.4204745590686798},{"id":"https://openalex.org/C124101348","wikidata":"https://www.wikidata.org/wiki/Q172491","display_name":"Data mining","level":1,"score":0.3818114101886749},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.36835354566574097},{"id":"https://openalex.org/C120314980","wikidata":"https://www.wikidata.org/wiki/Q180634","display_name":"Distributed computing","level":1,"score":0.35054320096969604},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.2514667212963104},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.14715003967285156},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.0},{"id":"https://openalex.org/C205649164","wikidata":"https://www.wikidata.org/wiki/Q1071","display_name":"Geography","level":0,"score":0.0},{"id":"https://openalex.org/C58640448","wikidata":"https://www.wikidata.org/wiki/Q42515","display_name":"Cartography","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1145/3557915.3560987","is_oa":false,"landing_page_url":"https://doi.org/10.1145/3557915.3560987","pdf_url":null,"source":{"id":"https://openalex.org/S4363608995","display_name":"Proceedings of the 30th International Conference on Advances in Geographic Information Systems","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":"conference"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 30th International Conference on Advances in Geographic Information Systems","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[{"id":"https://metadata.un.org/sdg/11","score":0.7799999713897705,"display_name":"Sustainable cities and communities"}],"awards":[{"id":"https://openalex.org/G7683087413","display_name":null,"funder_award_id":"STO 1114/4-2 FU 700/4-2","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":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":7,"referenced_works":["https://openalex.org/W1842723516","https://openalex.org/W1978211018","https://openalex.org/W2074435881","https://openalex.org/W2143083884","https://openalex.org/W2571463659","https://openalex.org/W2603995049","https://openalex.org/W4214841962"],"related_works":["https://openalex.org/W5921410","https://openalex.org/W2161466705","https://openalex.org/W2187647911","https://openalex.org/W2026584759","https://openalex.org/W2158210641","https://openalex.org/W4205716406","https://openalex.org/W2532352661","https://openalex.org/W2033556475","https://openalex.org/W2364500430","https://openalex.org/W4213299622"],"abstract_inverted_index":{"In":[0],"this":[1,54],"paper,":[2],"we":[3],"consider":[4],"the":[5,18,35,105,121,124,129,141,144,150,155,162],"problem":[6],"of":[7,26,47,123,126,143],"gradual":[8],"road":[9,16,82],"network":[10,17,36,131],"simplification,":[11],"where":[12],"given":[13],"an":[14],"embedded":[15],"goal":[19],"is":[20,87,136],"to":[21,33,75],"compute":[22],"a":[23,44,60,71,91,100],"fine-grained":[24],"succession":[25],"simplifications":[27],"with":[28,43],"decreasing":[29],"level-of-detail.":[30],"This":[31,138],"allows":[32],"render":[34],"on":[37,59,90,116],"any":[38],"desired":[39],"zoom":[40],"level":[41],"or":[42],"user-defined":[45],"number":[46],"segments.":[48],"Previous":[49],"work":[50],"has":[51],"established":[52],"that":[53],"can":[55,96],"be":[56],"achieved":[57],"based":[58,89],"Contraction":[61],"Hierarchies":[62],"(CH)":[63],"data":[64],"structure.":[65],"CH":[66,156],"was":[67],"originally":[68],"developed":[69],"as":[70,99,159,161],"graph":[72,92,134],"preprocessing":[73],"method":[74,107,152],"speed":[76],"up":[77],"shortest":[78],"path":[79],"planning":[80],"in":[81],"networks.":[83],"However,":[84],"since":[85],"it":[86,95],"inherently":[88],"simplification":[93,118],"mechanism,":[94],"also":[97],"serve":[98],"basis":[101],"for":[102,111,132],"rendering.":[103],"But":[104],"existing":[106,151],"exhibits":[108],"several":[109],"shortcomings,":[110],"example,":[112],"topological":[113],"inconsistencies":[114],"arise":[115],"many":[117],"levels":[119],"and":[120,128],"preservation":[122],"shape":[125],"routes":[127],"overall":[130],"coarser":[133],"representations":[135],"insufficient.":[137],"severely":[139],"impairs":[140],"navigability":[142],"map.":[145],"We":[146],"significantly":[147],"improve":[148],"upon":[149],"by":[153],"modifying":[154],"construction":[157],"process":[158],"well":[160],"rendering":[163],"algorithm.":[164]},"counts_by_year":[{"year":2024,"cited_by_count":2}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}