{"id":"https://openalex.org/W2138661093","doi":"https://doi.org/10.1145/2582112.2582144","title":"Computing the Fr\u00e9chet distance with shortcuts is NP-hard","display_name":"Computing the Fr\u00e9chet distance with shortcuts is NP-hard","publication_year":2014,"publication_date":"2014-05-02","ids":{"openalex":"https://openalex.org/W2138661093","doi":"https://doi.org/10.1145/2582112.2582144","mag":"2138661093"},"language":"en","primary_location":{"id":"doi:10.1145/2582112.2582144","is_oa":false,"landing_page_url":"https://doi.org/10.1145/2582112.2582144","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the thirtieth annual symposium on Computational geometry","raw_type":"proceedings-article"},"type":"conference-paper","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://pure.tue.nl/ws/files/90999235/cojawa.pdf","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5086805770","display_name":"Maike Buchin","orcid":"https://orcid.org/0000-0002-3446-4343"},"institutions":[{"id":"https://openalex.org/I904495901","display_name":"Ruhr University Bochum","ror":"https://ror.org/04tsk2644","country_code":"DE","type":"education","lineage":["https://openalex.org/I904495901"]}],"countries":["DE"],"is_corresponding":false,"raw_author_name":"Maike Buchin","raw_affiliation_strings":["Faculty of Mathematics, Ruhr-University Bochum"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Faculty of Mathematics, Ruhr-University Bochum","institution_ids":["https://openalex.org/I904495901"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5017692588","display_name":"Anne Driemel","orcid":"https://orcid.org/0000-0002-1943-2589"},"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":"Anne Driemel","raw_affiliation_strings":["Dep. Mathematics and Computer Science, TU Eindhoven","Dep. Mathematics and Computer Science, TU Eindhoven#TAB#"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Dep. Mathematics and Computer Science, TU Eindhoven","institution_ids":["https://openalex.org/I83019370"]},{"raw_affiliation_string":"Dep. Mathematics and Computer Science, TU Eindhoven#TAB#","institution_ids":["https://openalex.org/I83019370"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5000420564","display_name":"Bettina Speckmann","orcid":"https://orcid.org/0000-0002-8514-7858"},"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":"Bettina Speckmann","raw_affiliation_strings":["Dep. Mathematics and Computer Science, TU Eindhoven","Dep. Mathematics and Computer Science, TU Eindhoven#TAB#"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Dep. Mathematics and Computer Science, TU Eindhoven","institution_ids":["https://openalex.org/I83019370"]},{"raw_affiliation_string":"Dep. Mathematics and Computer Science, TU Eindhoven#TAB#","institution_ids":["https://openalex.org/I83019370"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":2,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":1.6542,"has_fulltext":true,"cited_by_count":19,"citation_normalized_percentile":{"value":0.8670098,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":98},"biblio":{"volume":null,"issue":null,"first_page":"367","last_page":"376"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11269","display_name":"Algorithms and Data Compression","score":0.9993000030517578,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"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/T11269","display_name":"Algorithms and Data Compression","score":0.9993000030517578,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"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/T10996","display_name":"Computational Geometry and Mesh Generation","score":0.9983999729156494,"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.9958999752998352,"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.6200982928276062}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6200982928276062}],"mesh":[],"locations_count":3,"locations":[{"id":"doi:10.1145/2582112.2582144","is_oa":false,"landing_page_url":"https://doi.org/10.1145/2582112.2582144","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the thirtieth annual symposium on Computational geometry","raw_type":"proceedings-article"},{"id":"pmh:oai:pure.tue.nl:openaire/9882c0f1-c421-473b-8e25-bd47477f9f3c","is_oa":true,"landing_page_url":"https://research.tue.nl/en/publications/9882c0f1-c421-473b-8e25-bd47477f9f3c","pdf_url":"https://pure.tue.nl/ws/files/90999235/cojawa.pdf","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":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Buchin, M, Driemel, A & Speckmann, B 2014, Computing the Fr\u00e9chet distance with shortcuts is NP-hard. in 30th ACM Symposium on Computational Geometry (SoCG, Kyoto, Japan, June 8-11, 2014). Association for Computing Machinery, Inc., New York NY, pp. 367-376, 30th Annual Symposium on Computational Geometry (SoCG 2014), Kyoto, Japan, 8/06/14. https://doi.org/10.1145/2582112.2582144","raw_type":"info:eu-repo/semantics/conferenceObject"},{"id":"pmh:tue:oai:pure.tue.nl:publications/9882c0f1-c421-473b-8e25-bd47477f9f3c","is_oa":true,"landing_page_url":"https://research.tue.nl/nl/publications/9882c0f1-c421-473b-8e25-bd47477f9f3c","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":"30th ACM Symposium on Computational Geometry (SoCG, Kyoto, Japan, June 8-11, 2014), 367 - 376","raw_type":"info:eu-repo/semantics/conferencepaper"}],"best_oa_location":{"id":"pmh:oai:pure.tue.nl:openaire/9882c0f1-c421-473b-8e25-bd47477f9f3c","is_oa":true,"landing_page_url":"https://research.tue.nl/en/publications/9882c0f1-c421-473b-8e25-bd47477f9f3c","pdf_url":"https://pure.tue.nl/ws/files/90999235/cojawa.pdf","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":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Buchin, M, Driemel, A & Speckmann, B 2014, Computing the Fr\u00e9chet distance with shortcuts is NP-hard. in 30th ACM Symposium on Computational Geometry (SoCG, Kyoto, Japan, June 8-11, 2014). Association for Computing Machinery, Inc., New York NY, pp. 367-376, 30th Annual Symposium on Computational Geometry (SoCG 2014), Kyoto, Japan, 8/06/14. https://doi.org/10.1145/2582112.2582144","raw_type":"info:eu-repo/semantics/conferenceObject"},"sustainable_development_goals":[{"score":0.7200000286102295,"display_name":"Peace, Justice and strong institutions","id":"https://metadata.un.org/sdg/16"}],"awards":[{"id":"https://openalex.org/G2587630285","display_name":null,"funder_award_id":"612.065.823","funder_id":"https://openalex.org/F4320321800","funder_display_name":"Nederlandse Organisatie voor Wetenschappelijk Onderzoek"},{"id":"https://openalex.org/G8407736463","display_name":null,"funder_award_id":"639.023.208","funder_id":"https://openalex.org/F4320321800","funder_display_name":"Nederlandse Organisatie voor Wetenschappelijk Onderzoek"}],"funders":[{"id":"https://openalex.org/F4320321800","display_name":"Nederlandse Organisatie voor Wetenschappelijk Onderzoek","ror":"https://ror.org/04jsz6e67"}],"has_content":{"pdf":true,"grobid_xml":true},"content_urls":{"pdf":"https://content.openalex.org/works/W2138661093.pdf","grobid_xml":"https://content.openalex.org/works/W2138661093.grobid-xml"},"referenced_works_count":23,"referenced_works":["https://openalex.org/W171730273","https://openalex.org/W183638769","https://openalex.org/W1517319335","https://openalex.org/W1521891106","https://openalex.org/W1544411027","https://openalex.org/W1967677853","https://openalex.org/W1983449524","https://openalex.org/W2010438541","https://openalex.org/W2015280640","https://openalex.org/W2041492362","https://openalex.org/W2042670297","https://openalex.org/W2083364906","https://openalex.org/W2124299914","https://openalex.org/W2147404308","https://openalex.org/W2157734830","https://openalex.org/W2162911459","https://openalex.org/W2172137407","https://openalex.org/W2570995828","https://openalex.org/W2612776813","https://openalex.org/W2804319230","https://openalex.org/W2950595168","https://openalex.org/W2952237967","https://openalex.org/W6680594500"],"related_works":["https://openalex.org/W2748952813","https://openalex.org/W2390279801","https://openalex.org/W2358668433","https://openalex.org/W2376932109","https://openalex.org/W2001405890","https://openalex.org/W2382290278","https://openalex.org/W2478288626","https://openalex.org/W2350741829","https://openalex.org/W2530322880","https://openalex.org/W1596801655"],"abstract_inverted_index":{"We":[0,87,124],"study":[1],"the":[2,10,27,74,91,94,98,106,114,122,130,137,145],"shortcut":[3,45,99],"Fr\u00e9chet":[4,11,31,46,100,115],"distance,":[5,12],"a":[6,34,111,133],"natural":[7],"variant":[8,112],"of":[9,26,96,113],"that":[13],"allows":[14,48],"us":[15,49],"to":[16,21,42,50,80],"take":[17],"shortcuts":[18,78],"from":[19],"and":[20,38,54,67,82,140],"any":[22],"point":[23],"along":[24],"one":[25],"curves.":[28],"The":[29,44],"classic":[30],"distance":[32,36,47,101,116],"is":[33,102,105],"bottle-neck":[35],"measure":[37],"hence":[39,55],"quite":[40],"sensitive":[41],"outliers.":[43],"cut":[51],"across":[52],"outliers":[53],"produces":[56],"more":[57],"meaningful":[58],"results":[59],"when":[60],"dealing":[61],"with":[62],"real":[63],"world":[64],"data.":[65],"Driemel":[66],"Har-Peled":[68],"recently":[69],"described":[70],"approximation":[71],"algorithms":[72,128,149],"for":[73,110,129,136,144],"restricted":[75],"case":[76,139],"where":[77],"have":[79],"start":[81],"end":[83],"at":[84],"input":[85],"vertices.":[86],"show":[88],"that,":[89],"in":[90,121,151],"general":[92,138],"case,":[93],"problem":[95],"computing":[97],"NP-hard.":[103],"This":[104],"first":[107],"hardness":[108],"result":[109],"between":[117],"two":[118,127],"polygonal":[119],"curves":[120],"plane.":[123],"also":[125],"present":[126],"decision":[131],"problem:":[132],"3-approximation":[134],"algorithm":[135,143],"an":[141],"exact":[142],"vertex-restricted":[146],"case.":[147],"Both":[148],"run":[150],"O(n3":[152],"log":[153],"n)":[154],"time.":[155]},"counts_by_year":[{"year":2025,"cited_by_count":1},{"year":2024,"cited_by_count":2},{"year":2023,"cited_by_count":1},{"year":2020,"cited_by_count":3},{"year":2019,"cited_by_count":1},{"year":2018,"cited_by_count":1},{"year":2016,"cited_by_count":1},{"year":2015,"cited_by_count":4},{"year":2014,"cited_by_count":3},{"year":2013,"cited_by_count":1},{"year":2012,"cited_by_count":1}],"updated_date":"2026-07-29T14:22:42.915294","created_date":"2025-10-10T00:00:00"}