{"id":"https://openalex.org/W3184650363","doi":"https://doi.org/10.1145/3460656","title":"Discrete Fr\u00e9chet Distance under Translation","display_name":"Discrete Fr\u00e9chet Distance under Translation","publication_year":2021,"publication_date":"2021-07-15","ids":{"openalex":"https://openalex.org/W3184650363","doi":"https://doi.org/10.1145/3460656","mag":"3184650363"},"language":"en","primary_location":{"id":"doi:10.1145/3460656","is_oa":true,"landing_page_url":"https://doi.org/10.1145/3460656","pdf_url":"https://dl.acm.org/doi/pdf/10.1145/3460656","source":{"id":"https://openalex.org/S137348503","display_name":"ACM Transactions on Algorithms","issn_l":"1549-6325","issn":["1549-6325","1549-6333"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319798","host_organization_name":"Association for Computing Machinery","host_organization_lineage":["https://openalex.org/P4310319798"],"host_organization_lineage_names":["Association for Computing Machinery"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"ACM Transactions on Algorithms","raw_type":"journal-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"hybrid","oa_url":"https://dl.acm.org/doi/pdf/10.1145/3460656","any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5044394587","display_name":"Karl Bringmann","orcid":"https://orcid.org/0000-0003-1356-5177"},"institutions":[{"id":"https://openalex.org/I4210109712","display_name":"Max Planck Institute for Informatics","ror":"https://ror.org/01w19ak89","country_code":"DE","type":"facility","lineage":["https://openalex.org/I149899117","https://openalex.org/I4210109712"]},{"id":"https://openalex.org/I91712215","display_name":"Saarland University","ror":"https://ror.org/01jdpyv68","country_code":"DE","type":"education","lineage":["https://openalex.org/I91712215"]}],"countries":["DE"],"is_corresponding":false,"raw_author_name":"Karl Bringmann","raw_affiliation_strings":["Saarland University and Max Planck Institute for Informatics, Saarland Informatics Campus, Germany"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Saarland University and Max Planck Institute for Informatics, Saarland Informatics Campus, Germany","institution_ids":["https://openalex.org/I4210109712","https://openalex.org/I91712215"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5088790846","display_name":"Marvin K\u00fcnnemann","orcid":"https://orcid.org/0000-0003-4813-4852"},"institutions":[{"id":"https://openalex.org/I4210109712","display_name":"Max Planck Institute for Informatics","ror":"https://ror.org/01w19ak89","country_code":"DE","type":"facility","lineage":["https://openalex.org/I149899117","https://openalex.org/I4210109712"]}],"countries":["DE"],"is_corresponding":false,"raw_author_name":"Marvin K\u00fcNnemann","raw_affiliation_strings":["Max Planck Institute for Informatics, Saarland Informatics Campus, Germany"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Max Planck Institute for Informatics, Saarland Informatics Campus, Germany","institution_ids":["https://openalex.org/I4210109712"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5050906094","display_name":"Andr\u00e9 Nusser","orcid":"https://orcid.org/0000-0002-6349-869X"},"institutions":[{"id":"https://openalex.org/I4210109712","display_name":"Max Planck Institute for Informatics","ror":"https://ror.org/01w19ak89","country_code":"DE","type":"facility","lineage":["https://openalex.org/I149899117","https://openalex.org/I4210109712"]}],"countries":["DE"],"is_corresponding":false,"raw_author_name":"Andr\u00e9 Nusser","raw_affiliation_strings":["Max Planck Institute for Informatics and Graduate School of Computer Science, Saarland Informatics Campus, Germany"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Max Planck Institute for Informatics and Graduate School of Computer Science, Saarland Informatics Campus, Germany","institution_ids":["https://openalex.org/I4210109712"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":2.3779,"has_fulltext":true,"cited_by_count":6,"citation_normalized_percentile":{"value":0.92035398,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":94,"max":97},"biblio":{"volume":"17","issue":"3","first_page":"1","last_page":"42"},"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.9998999834060669,"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.9998999834060669,"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.9997000098228455,"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/T12923","display_name":"Digital Image Processing Techniques","score":0.9969000220298767,"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/reachability","display_name":"Reachability","score":0.8770859241485596},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.6377264261245728},{"id":"https://openalex.org/keywords/edit-distance","display_name":"Edit distance","score":0.6035962104797363},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.5734528303146362},{"id":"https://openalex.org/keywords/translation","display_name":"Translation (biology)","score":0.557539701461792},{"id":"https://openalex.org/keywords/directed-graph","display_name":"Directed graph","score":0.5230199694633484},{"id":"https://openalex.org/keywords/amortized-analysis","display_name":"Amortized analysis","score":0.51896733045578},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.5140196084976196},{"id":"https://openalex.org/keywords/traverse","display_name":"Traverse","score":0.5093218088150024},{"id":"https://openalex.org/keywords/measure","display_name":"Measure (data warehouse)","score":0.4863148629665375},{"id":"https://openalex.org/keywords/grid","display_name":"Grid","score":0.48206955194473267},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.4645879566669464},{"id":"https://openalex.org/keywords/exponential-function","display_name":"Exponential function","score":0.43234682083129883},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.42597806453704834},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.41354307532310486},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.30792945623397827},{"id":"https://openalex.org/keywords/data-structure","display_name":"Data structure","score":0.24234306812286377},{"id":"https://openalex.org/keywords/geometry","display_name":"Geometry","score":0.1695755422115326}],"concepts":[{"id":"https://openalex.org/C136643341","wikidata":"https://www.wikidata.org/wiki/Q1361526","display_name":"Reachability","level":2,"score":0.8770859241485596},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.6377264261245728},{"id":"https://openalex.org/C44359876","wikidata":"https://www.wikidata.org/wiki/Q5338467","display_name":"Edit distance","level":2,"score":0.6035962104797363},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.5734528303146362},{"id":"https://openalex.org/C149364088","wikidata":"https://www.wikidata.org/wiki/Q185917","display_name":"Translation (biology)","level":4,"score":0.557539701461792},{"id":"https://openalex.org/C146380142","wikidata":"https://www.wikidata.org/wiki/Q1137726","display_name":"Directed graph","level":2,"score":0.5230199694633484},{"id":"https://openalex.org/C142417499","wikidata":"https://www.wikidata.org/wiki/Q331716","display_name":"Amortized analysis","level":3,"score":0.51896733045578},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.5140196084976196},{"id":"https://openalex.org/C176809094","wikidata":"https://www.wikidata.org/wiki/Q15401496","display_name":"Traverse","level":2,"score":0.5093218088150024},{"id":"https://openalex.org/C2780009758","wikidata":"https://www.wikidata.org/wiki/Q6804172","display_name":"Measure (data warehouse)","level":2,"score":0.4863148629665375},{"id":"https://openalex.org/C187691185","wikidata":"https://www.wikidata.org/wiki/Q2020720","display_name":"Grid","level":2,"score":0.48206955194473267},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.4645879566669464},{"id":"https://openalex.org/C151376022","wikidata":"https://www.wikidata.org/wiki/Q168698","display_name":"Exponential function","level":2,"score":0.43234682083129883},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.42597806453704834},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.41354307532310486},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.30792945623397827},{"id":"https://openalex.org/C162319229","wikidata":"https://www.wikidata.org/wiki/Q175263","display_name":"Data structure","level":2,"score":0.24234306812286377},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.1695755422115326},{"id":"https://openalex.org/C205649164","wikidata":"https://www.wikidata.org/wiki/Q1071","display_name":"Geography","level":0,"score":0.0},{"id":"https://openalex.org/C13280743","wikidata":"https://www.wikidata.org/wiki/Q131089","display_name":"Geodesy","level":1,"score":0.0},{"id":"https://openalex.org/C77088390","wikidata":"https://www.wikidata.org/wiki/Q8513","display_name":"Database","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},{"id":"https://openalex.org/C55493867","wikidata":"https://www.wikidata.org/wiki/Q7094","display_name":"Biochemistry","level":1,"score":0.0},{"id":"https://openalex.org/C185592680","wikidata":"https://www.wikidata.org/wiki/Q2329","display_name":"Chemistry","level":0,"score":0.0},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0},{"id":"https://openalex.org/C104317684","wikidata":"https://www.wikidata.org/wiki/Q7187","display_name":"Gene","level":2,"score":0.0},{"id":"https://openalex.org/C105580179","wikidata":"https://www.wikidata.org/wiki/Q188928","display_name":"Messenger RNA","level":3,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1145/3460656","is_oa":true,"landing_page_url":"https://doi.org/10.1145/3460656","pdf_url":"https://dl.acm.org/doi/pdf/10.1145/3460656","source":{"id":"https://openalex.org/S137348503","display_name":"ACM Transactions on Algorithms","issn_l":"1549-6325","issn":["1549-6325","1549-6333"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319798","host_organization_name":"Association for Computing Machinery","host_organization_lineage":["https://openalex.org/P4310319798"],"host_organization_lineage_names":["Association for Computing Machinery"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"ACM Transactions on Algorithms","raw_type":"journal-article"}],"best_oa_location":{"id":"doi:10.1145/3460656","is_oa":true,"landing_page_url":"https://doi.org/10.1145/3460656","pdf_url":"https://dl.acm.org/doi/pdf/10.1145/3460656","source":{"id":"https://openalex.org/S137348503","display_name":"ACM Transactions on Algorithms","issn_l":"1549-6325","issn":["1549-6325","1549-6333"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319798","host_organization_name":"Association for Computing Machinery","host_organization_lineage":["https://openalex.org/P4310319798"],"host_organization_lineage_names":["Association for Computing Machinery"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"ACM Transactions on Algorithms","raw_type":"journal-article"},"sustainable_development_goals":[],"awards":[{"id":"https://openalex.org/G5279399150","display_name":"Technology Transfer between Integer Programming and Efficient Algorithms","funder_award_id":"850979","funder_id":"https://openalex.org/F4320338335","funder_display_name":"H2020 European Research Council"}],"funders":[{"id":"https://openalex.org/F4320338335","display_name":"H2020 European Research Council","ror":"https://ror.org/0472cxd90"}],"has_content":{"pdf":true,"grobid_xml":true},"content_urls":{"pdf":"https://content.openalex.org/works/W3184650363.pdf","grobid_xml":"https://content.openalex.org/works/W3184650363.grobid-xml"},"referenced_works_count":34,"referenced_works":["https://openalex.org/W1540680813","https://openalex.org/W1580945513","https://openalex.org/W1967985699","https://openalex.org/W1974526404","https://openalex.org/W1979109797","https://openalex.org/W1985572324","https://openalex.org/W1999933456","https://openalex.org/W2008735761","https://openalex.org/W2013382394","https://openalex.org/W2014465300","https://openalex.org/W2017675289","https://openalex.org/W2028558845","https://openalex.org/W2064671795","https://openalex.org/W2083364906","https://openalex.org/W2084732238","https://openalex.org/W2085933841","https://openalex.org/W2085938995","https://openalex.org/W2097004206","https://openalex.org/W2103099082","https://openalex.org/W2121770144","https://openalex.org/W2124299914","https://openalex.org/W2134112278","https://openalex.org/W2157734830","https://openalex.org/W2176269458","https://openalex.org/W2618849866","https://openalex.org/W2773593212","https://openalex.org/W2779088922","https://openalex.org/W2779876493","https://openalex.org/W2949439292","https://openalex.org/W2952237967","https://openalex.org/W2963123599","https://openalex.org/W3105607278","https://openalex.org/W4247633649","https://openalex.org/W6677026181"],"related_works":["https://openalex.org/W2377402383","https://openalex.org/W2380835401","https://openalex.org/W2381912691","https://openalex.org/W2350381577","https://openalex.org/W2353618196","https://openalex.org/W2348074676","https://openalex.org/W2385033175","https://openalex.org/W2374043190","https://openalex.org/W2363298784","https://openalex.org/W2367402697"],"abstract_inverted_index":{"The":[0,102],"discrete":[1,17,180,222],"Fr\u00e9chet":[2,18,181,223],"distance":[3,19,182,224],"is":[4,15,55,107,112,199],"a":[5,78,207],"popular":[6],"measure":[7],"for":[8,178,220],"comparing":[9],"polygonal":[10,34],"curves.":[11],"An":[12],"important":[13],"variant":[14,141,157],"the":[16,40,42,134,179,191,202,217,221,228],"under":[20,183,225],"translation,":[21,226],"which":[22,90],"enables":[23],"detection":[24],"of":[25,36,61,63,82,104,133,142,173,193,211],"similar":[26],"movement":[27],"patterns":[28],"in":[29,39,47,77,94,120,148,158,168,201],"different":[30],"spatial":[31],"domains.":[32],"For":[33],"curves":[35],"length":[37],"n":[38,50,66,87,212],"plane,":[41],"fastest":[43],"known":[44],"algorithm":[45],"runs":[46],"time":[48,95,160,172,219],"\u00d5(":[49,65,86,161,174,195],"5":[51,88],")":[52,98,164,177,198],"[12].":[53],"This":[54],"achieved":[56],"by":[57,205],"constructing":[58,190],"an":[59,113,139,169],"arrangement":[60,192],"disks":[62],"size":[64,83,194],"4":[67,197,213],"),":[68,89,128],"and":[69,153],"then":[70],"traversing":[71],"its":[72],"faces":[73],"while":[74],"updating":[75],"reachability":[76,119],"directed":[79,121,149],"grid":[80,122,150],"graph":[81],"N":[84,97,127,162,175,196],":=":[85],"can":[91],"be":[92],"done":[93],"\u00d5(\u221a":[96,126],"per":[99,165],"update":[100],"[27].":[101],"contribution":[103],"this":[105,131,156],"article":[106],"two-fold.":[108],"First,":[109],"although":[110],"it":[111],"open":[114],"problem":[115],"to":[116],"solve":[117,155],"dynamic":[118,143],"graphs":[123,151],"faster":[124],"than":[125],"we":[129,154,186],"improve":[130],"part":[132],"algorithm:":[135],"We":[136],"observe":[137],"that":[138,189],"offline":[140],"s":[144],"-":[145,214],"t":[146],"-reachability":[147],"suffices,":[152],"amortized":[159],"1/3":[163],"update,":[166],"resulting":[167],"improved":[170],"running":[171,218],"4.66":[176],"translation.":[184],"Second,":[185],"provide":[187],"evidence":[188],"necessary":[200],"worst":[203],"case":[204],"proving":[206],"conditional":[208],"lower":[209],"bound":[210],"o(1)":[215],"on":[216],"assuming":[227],"Strong":[229],"Exponential":[230],"Time":[231],"Hypothesis.":[232]},"counts_by_year":[{"year":2024,"cited_by_count":2},{"year":2022,"cited_by_count":4}],"updated_date":"2026-06-11T09:08:48.828518","created_date":"2025-10-10T00:00:00"}