{"id":"https://openalex.org/W2472794538","doi":"https://doi.org/10.1145/2835185.2835186","title":"A Fast Algorithm for Matching Planar Maps with Minimum Fr\u00e9chet Distances","display_name":"A Fast Algorithm for Matching Planar Maps with Minimum Fr\u00e9chet Distances","publication_year":2015,"publication_date":"2015-11-03","ids":{"openalex":"https://openalex.org/W2472794538","doi":"https://doi.org/10.1145/2835185.2835186","mag":"2472794538"},"language":"en","primary_location":{"id":"doi:10.1145/2835185.2835186","is_oa":true,"landing_page_url":"https://doi.org/10.1145/2835185.2835186","pdf_url":"https://dl.acm.org/doi/pdf/10.1145/2835185.2835186","source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 4th International ACM SIGSPATIAL Workshop on Analytics for Big Geospatial Data","raw_type":"proceedings-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"gold","oa_url":"https://dl.acm.org/doi/pdf/10.1145/2835185.2835186","any_repository_has_fulltext":null},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5070824790","display_name":"Junichi Shigezumi","orcid":"https://orcid.org/0000-0002-0034-5821"},"institutions":[{"id":"https://openalex.org/I2252096349","display_name":"Fujitsu (Japan)","ror":"https://ror.org/038e2g226","country_code":"JP","type":"company","lineage":["https://openalex.org/I2252096349"]}],"countries":["JP"],"is_corresponding":false,"raw_author_name":"Junichi Shigezumi","raw_affiliation_strings":["Fujitsu Laboratories Ltd., Nakahara-ku, Kawasaki, Japan"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Fujitsu Laboratories Ltd., Nakahara-ku, Kawasaki, Japan","institution_ids":["https://openalex.org/I2252096349"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5103329339","display_name":"Tatsuya Asai","orcid":"https://orcid.org/0009-0003-9708-2929"},"institutions":[{"id":"https://openalex.org/I2252096349","display_name":"Fujitsu (Japan)","ror":"https://ror.org/038e2g226","country_code":"JP","type":"company","lineage":["https://openalex.org/I2252096349"]}],"countries":["JP"],"is_corresponding":false,"raw_author_name":"Tatsuya Asai","raw_affiliation_strings":["Fujitsu Laboratories Ltd., Nakahara-ku, Kawasaki, Japan"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Fujitsu Laboratories Ltd., Nakahara-ku, Kawasaki, Japan","institution_ids":["https://openalex.org/I2252096349"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5108727434","display_name":"Hiroaki Morikawa","orcid":null},"institutions":[{"id":"https://openalex.org/I2252096349","display_name":"Fujitsu (Japan)","ror":"https://ror.org/038e2g226","country_code":"JP","type":"company","lineage":["https://openalex.org/I2252096349"]}],"countries":["JP"],"is_corresponding":false,"raw_author_name":"Hiroaki Morikawa","raw_affiliation_strings":["Fujitsu Laboratories Ltd., Nakahara-ku, Kawasaki, Japan"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Fujitsu Laboratories Ltd., Nakahara-ku, Kawasaki, Japan","institution_ids":["https://openalex.org/I2252096349"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5026511704","display_name":"Hiroya Inakoshi","orcid":"https://orcid.org/0000-0003-4405-8952"},"institutions":[{"id":"https://openalex.org/I2252096349","display_name":"Fujitsu (Japan)","ror":"https://ror.org/038e2g226","country_code":"JP","type":"company","lineage":["https://openalex.org/I2252096349"]}],"countries":["JP"],"is_corresponding":false,"raw_author_name":"Hiroya Inakoshi","raw_affiliation_strings":["Fujitsu Laboratories Ltd., Nakahara-ku, Kawasaki, Japan"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Fujitsu Laboratories Ltd., Nakahara-ku, Kawasaki, Japan","institution_ids":["https://openalex.org/I2252096349"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":4,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.5799,"has_fulltext":true,"cited_by_count":5,"citation_normalized_percentile":{"value":0.71332452,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":94},"biblio":{"volume":null,"issue":null,"first_page":"25","last_page":"34"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11106","display_name":"Data Management and Algorithms","score":0.9998999834060669,"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"}},"topics":[{"id":"https://openalex.org/T11106","display_name":"Data Management and Algorithms","score":0.9998999834060669,"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/T10757","display_name":"Geographic Information Systems Studies","score":0.9958000183105469,"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/T11980","display_name":"Human Mobility and Location-Based Analysis","score":0.9933000206947327,"subfield":{"id":"https://openalex.org/subfields/3313","display_name":"Transportation"},"field":{"id":"https://openalex.org/fields/33","display_name":"Social Sciences"},"domain":{"id":"https://openalex.org/domains/2","display_name":"Social Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/dijkstras-algorithm","display_name":"Dijkstra's algorithm","score":0.6785308122634888},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.6540663838386536},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5705491304397583},{"id":"https://openalex.org/keywords/trajectory","display_name":"Trajectory","score":0.5646056532859802},{"id":"https://openalex.org/keywords/path","display_name":"Path (computing)","score":0.5548619627952576},{"id":"https://openalex.org/keywords/matching","display_name":"Matching (statistics)","score":0.5146306753158569},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.5032126307487488},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.4870319962501526},{"id":"https://openalex.org/keywords/shortest-path-problem","display_name":"Shortest path problem","score":0.4560217559337616},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.3720109164714813},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.1977251172065735}],"concepts":[{"id":"https://openalex.org/C173870130","wikidata":"https://www.wikidata.org/wiki/Q8548","display_name":"Dijkstra's algorithm","level":4,"score":0.6785308122634888},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.6540663838386536},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5705491304397583},{"id":"https://openalex.org/C13662910","wikidata":"https://www.wikidata.org/wiki/Q193139","display_name":"Trajectory","level":2,"score":0.5646056532859802},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.5548619627952576},{"id":"https://openalex.org/C165064840","wikidata":"https://www.wikidata.org/wiki/Q1321061","display_name":"Matching (statistics)","level":2,"score":0.5146306753158569},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.5032126307487488},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.4870319962501526},{"id":"https://openalex.org/C22590252","wikidata":"https://www.wikidata.org/wiki/Q1058754","display_name":"Shortest path problem","level":3,"score":0.4560217559337616},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.3720109164714813},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.1977251172065735},{"id":"https://openalex.org/C105795698","wikidata":"https://www.wikidata.org/wiki/Q12483","display_name":"Statistics","level":1,"score":0.0},{"id":"https://openalex.org/C121332964","wikidata":"https://www.wikidata.org/wiki/Q413","display_name":"Physics","level":0,"score":0.0},{"id":"https://openalex.org/C1276947","wikidata":"https://www.wikidata.org/wiki/Q333","display_name":"Astronomy","level":1,"score":0.0},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1145/2835185.2835186","is_oa":true,"landing_page_url":"https://doi.org/10.1145/2835185.2835186","pdf_url":"https://dl.acm.org/doi/pdf/10.1145/2835185.2835186","source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 4th International ACM SIGSPATIAL Workshop on Analytics for Big Geospatial Data","raw_type":"proceedings-article"}],"best_oa_location":{"id":"doi:10.1145/2835185.2835186","is_oa":true,"landing_page_url":"https://doi.org/10.1145/2835185.2835186","pdf_url":"https://dl.acm.org/doi/pdf/10.1145/2835185.2835186","source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 4th International ACM SIGSPATIAL Workshop on Analytics for Big Geospatial Data","raw_type":"proceedings-article"},"sustainable_development_goals":[{"id":"https://metadata.un.org/sdg/16","score":0.7200000286102295,"display_name":"Peace, Justice and strong institutions"}],"awards":[],"funders":[],"has_content":{"pdf":true,"grobid_xml":true},"content_urls":{"pdf":"https://content.openalex.org/works/W2472794538.pdf","grobid_xml":"https://content.openalex.org/works/W2472794538.grobid-xml"},"referenced_works_count":33,"referenced_works":["https://openalex.org/W54893867","https://openalex.org/W169951068","https://openalex.org/W1493392022","https://openalex.org/W1514900972","https://openalex.org/W1519770485","https://openalex.org/W1544411027","https://openalex.org/W1626398438","https://openalex.org/W1796251476","https://openalex.org/W2013382394","https://openalex.org/W2020602155","https://openalex.org/W2031674781","https://openalex.org/W2032968225","https://openalex.org/W2065674789","https://openalex.org/W2078448683","https://openalex.org/W2083244827","https://openalex.org/W2084404970","https://openalex.org/W2093651920","https://openalex.org/W2123644741","https://openalex.org/W2124299914","https://openalex.org/W2135822894","https://openalex.org/W2136317921","https://openalex.org/W2138237549","https://openalex.org/W2140251882","https://openalex.org/W2150177647","https://openalex.org/W2153482597","https://openalex.org/W2156531019","https://openalex.org/W2166771065","https://openalex.org/W2172041433","https://openalex.org/W2570995828","https://openalex.org/W2612776813","https://openalex.org/W2752885492","https://openalex.org/W4213012742","https://openalex.org/W4372046852"],"related_works":["https://openalex.org/W3209137076","https://openalex.org/W2374560440","https://openalex.org/W1490490684","https://openalex.org/W4221129498","https://openalex.org/W2887026015","https://openalex.org/W2361442013","https://openalex.org/W2373384475","https://openalex.org/W4310124294","https://openalex.org/W143403600","https://openalex.org/W2761711678"],"abstract_inverted_index":{"In":[0,125],"this":[1],"paper,":[2],"we":[3,127],"present":[4],"a":[5,11,15,18,26,31,57,72,100,185,194,198],"fast":[6],"and":[7,84,99,138,142],"practical":[8],"algorithm":[9,112,166,175],"for":[10,91,116],"map-matching":[12],"problem":[13,105,187],"searching":[14,132],"path":[16,58,101],"on":[17,35,56,59,197],"given":[19,27],"graph":[20,61,131],"that":[21,164],"minimizes":[22],"Fr\u00e9chet":[23,50,94,204],"distance":[24,51,95],"from":[25,65],"trajectory,":[28],"which":[29,147,181],"is":[30,182],"natural":[32],"measurement":[33],"based":[34],"the":[36,40,49,60,63,66,69,76,93,97,104,110,122,136,152,159,174,203],"sequential":[37],"order":[38,64],"of":[39,68,176,200,202],"trajectory.":[41],"However,":[42],"it":[43,79],"sometimes":[44],"costs":[45],"seriously":[46],"to":[47,55,82,102,113,135,140,157,189],"compute":[48],"while":[52],"making":[53],"correspondences":[54],"in":[62],"beginning":[67],"trajectory":[70,98],"as":[71,184],"naive":[73,123],"method":[74],"(as":[75],"definition)":[77],"since":[78],"often":[80],"occurs":[81],"backtrack":[83],"recompute.":[85],"We":[86],"developed":[87],"an":[88],"incremental":[89],"technique":[90,137],"updating":[92],"between":[96],"overcome":[103],"stated":[106],"above.":[107],"It":[108],"enables":[109],"proposed":[111],"evaluate":[114,143],"distances":[115],"any":[117],"candidate":[118],"paths":[119],"faster":[120,172],"than":[121,169,173],"one.":[124],"addition,":[126],"can":[128],"adopt":[129],"Dijkstra's":[130],"manner":[133],"due":[134],"omit":[139],"search":[141,196],"some":[144],"useless":[145],"candidates":[146,201],"have":[148],"no":[149],"relations":[150],"with":[151,193],"solution.":[153],"That":[154],"also":[155],"contributes":[156],"accelerate":[158],"algorithm.":[160],"Experimental":[161],"results":[162],"show":[163],"our":[165],"was":[167],"more":[168],"fifty":[170],"times":[171],"Alt":[177],"(J.":[178],"Algorithms":[179],"2003),":[180],"formulated":[183],"optimization":[186],"repeating":[188],"solve":[190],"decision":[191],"problems":[192],"binary":[195],"set":[199],"distance.":[205]},"counts_by_year":[{"year":2024,"cited_by_count":1},{"year":2022,"cited_by_count":1},{"year":2019,"cited_by_count":1},{"year":2018,"cited_by_count":1},{"year":2017,"cited_by_count":1}],"updated_date":"2026-06-11T09:08:48.828518","created_date":"2025-10-10T00:00:00"}