{"id":"https://openalex.org/W2126189766","doi":"https://doi.org/10.1145/1137856.1137870","title":"Computing the Fr\u00e9chet distance between simple polygons in polynomial time","display_name":"Computing the Fr\u00e9chet distance between simple polygons in polynomial time","publication_year":2006,"publication_date":"2006-06-05","ids":{"openalex":"https://openalex.org/W2126189766","doi":"https://doi.org/10.1145/1137856.1137870","mag":"2126189766"},"language":"en","primary_location":{"id":"doi:10.1145/1137856.1137870","is_oa":false,"landing_page_url":"https://doi.org/10.1145/1137856.1137870","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the twenty-second annual symposium on Computational geometry","raw_type":"proceedings-article"},"type":"conference-paper","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/A5077490455","display_name":"Kevin Buchin","orcid":"https://orcid.org/0000-0002-3022-7877"},"institutions":[{"id":"https://openalex.org/I75951250","display_name":"Freie Universit\u00e4t Berlin","ror":"https://ror.org/046ak2485","country_code":"DE","type":"education","lineage":["https://openalex.org/I75951250"]}],"countries":["DE"],"is_corresponding":false,"raw_author_name":"Kevin Buchin","raw_affiliation_strings":["Freie Universit\u00e4t Berlin, Berlin, Germany"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Freie Universit\u00e4t Berlin, Berlin, Germany","institution_ids":["https://openalex.org/I75951250"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5086805770","display_name":"Maike Buchin","orcid":"https://orcid.org/0000-0002-3446-4343"},"institutions":[{"id":"https://openalex.org/I75951250","display_name":"Freie Universit\u00e4t Berlin","ror":"https://ror.org/046ak2485","country_code":"DE","type":"education","lineage":["https://openalex.org/I75951250"]}],"countries":["DE"],"is_corresponding":false,"raw_author_name":"Maike Buchin","raw_affiliation_strings":["Freie Universit\u00e4t Berlin, Berlin, Germany"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Freie Universit\u00e4t Berlin, Berlin, Germany","institution_ids":["https://openalex.org/I75951250"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5054903605","display_name":"Carola Wenk","orcid":"https://orcid.org/0000-0001-9275-5336"},"institutions":[{"id":"https://openalex.org/I45438204","display_name":"The University of Texas at San Antonio","ror":"https://ror.org/01kd65564","country_code":"US","type":"education","lineage":["https://openalex.org/I45438204"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Carola Wenk","raw_affiliation_strings":["University of Texas, San Antonio, TX","[University of Texas, San Antonio, TX]"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"University of Texas, San Antonio, TX","institution_ids":["https://openalex.org/I45438204"]},{"raw_affiliation_string":"[University of Texas, San Antonio, TX]","institution_ids":["https://openalex.org/I45438204"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":2,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":null,"has_fulltext":false,"cited_by_count":44,"citation_normalized_percentile":null,"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":"80","last_page":"87"},"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.9995999932289124,"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.9995999932289124,"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.9871000051498413,"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.9825999736785889,"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/polygon","display_name":"Polygon (computer graphics)","score":0.7947327494621277},{"id":"https://openalex.org/keywords/simple-polygon","display_name":"Simple polygon","score":0.7748143672943115},{"id":"https://openalex.org/keywords/triangulation","display_name":"Triangulation","score":0.7361667156219482},{"id":"https://openalex.org/keywords/diagonal","display_name":"Diagonal","score":0.6509644985198975},{"id":"https://openalex.org/keywords/polygon-covering","display_name":"Polygon covering","score":0.5605155229568481},{"id":"https://openalex.org/keywords/simple","display_name":"Simple (philosophy)","score":0.5490541458129883},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.5189799666404724},{"id":"https://openalex.org/keywords/star-shaped-polygon","display_name":"Star-shaped polygon","score":0.5073768496513367},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.495608925819397},{"id":"https://openalex.org/keywords/rectilinear-polygon","display_name":"Rectilinear polygon","score":0.4954262971878052},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.48757404088974},{"id":"https://openalex.org/keywords/point-in-polygon","display_name":"Point in polygon","score":0.4704652726650238},{"id":"https://openalex.org/keywords/point-set-triangulation","display_name":"Point set triangulation","score":0.42774638533592224},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.3787350654602051},{"id":"https://openalex.org/keywords/regular-polygon","display_name":"Regular polygon","score":0.27627885341644287},{"id":"https://openalex.org/keywords/geometry","display_name":"Geometry","score":0.13651427626609802},{"id":"https://openalex.org/keywords/delaunay-triangulation","display_name":"Delaunay triangulation","score":0.11225804686546326}],"concepts":[{"id":"https://openalex.org/C190694206","wikidata":"https://www.wikidata.org/wiki/Q3276654","display_name":"Polygon (computer graphics)","level":3,"score":0.7947327494621277},{"id":"https://openalex.org/C197949415","wikidata":"https://www.wikidata.org/wiki/Q782746","display_name":"Simple polygon","level":3,"score":0.7748143672943115},{"id":"https://openalex.org/C135981907","wikidata":"https://www.wikidata.org/wiki/Q188056","display_name":"Triangulation","level":2,"score":0.7361667156219482},{"id":"https://openalex.org/C130367717","wikidata":"https://www.wikidata.org/wiki/Q189791","display_name":"Diagonal","level":2,"score":0.6509644985198975},{"id":"https://openalex.org/C187778580","wikidata":"https://www.wikidata.org/wiki/Q18389289","display_name":"Polygon covering","level":3,"score":0.5605155229568481},{"id":"https://openalex.org/C2780586882","wikidata":"https://www.wikidata.org/wiki/Q7520643","display_name":"Simple (philosophy)","level":2,"score":0.5490541458129883},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.5189799666404724},{"id":"https://openalex.org/C96366933","wikidata":"https://www.wikidata.org/wiki/Q2122886","display_name":"Star-shaped polygon","level":5,"score":0.5073768496513367},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.495608925819397},{"id":"https://openalex.org/C170542616","wikidata":"https://www.wikidata.org/wiki/Q7303186","display_name":"Rectilinear polygon","level":4,"score":0.4954262971878052},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.48757404088974},{"id":"https://openalex.org/C59902600","wikidata":"https://www.wikidata.org/wiki/Q1575331","display_name":"Point in polygon","level":3,"score":0.4704652726650238},{"id":"https://openalex.org/C167117609","wikidata":"https://www.wikidata.org/wiki/Q17078161","display_name":"Point set triangulation","level":3,"score":0.42774638533592224},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.3787350654602051},{"id":"https://openalex.org/C112680207","wikidata":"https://www.wikidata.org/wiki/Q714886","display_name":"Regular polygon","level":2,"score":0.27627885341644287},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.13651427626609802},{"id":"https://openalex.org/C68010082","wikidata":"https://www.wikidata.org/wiki/Q192445","display_name":"Delaunay triangulation","level":2,"score":0.11225804686546326},{"id":"https://openalex.org/C126042441","wikidata":"https://www.wikidata.org/wiki/Q1324888","display_name":"Frame (networking)","level":2,"score":0.0},{"id":"https://openalex.org/C111472728","wikidata":"https://www.wikidata.org/wiki/Q9471","display_name":"Epistemology","level":1,"score":0.0},{"id":"https://openalex.org/C76155785","wikidata":"https://www.wikidata.org/wiki/Q418","display_name":"Telecommunications","level":1,"score":0.0},{"id":"https://openalex.org/C49870271","wikidata":"https://www.wikidata.org/wiki/Q193657","display_name":"Convex set","level":4,"score":0.0},{"id":"https://openalex.org/C157972887","wikidata":"https://www.wikidata.org/wiki/Q463359","display_name":"Convex optimization","level":3,"score":0.0},{"id":"https://openalex.org/C138885662","wikidata":"https://www.wikidata.org/wiki/Q5891","display_name":"Philosophy","level":0,"score":0.0}],"mesh":[],"locations_count":3,"locations":[{"id":"doi:10.1145/1137856.1137870","is_oa":false,"landing_page_url":"https://doi.org/10.1145/1137856.1137870","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the twenty-second annual symposium on Computational geometry","raw_type":"proceedings-article"},{"id":"pmh:oai:pure.tue.nl:openaire_cris_publications/cfa3452e-37d3-4379-93af-5772235b1a69","is_oa":false,"landing_page_url":"https://research.tue.nl/en/publications/cfa3452e-37d3-4379-93af-5772235b1a69","pdf_url":null,"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":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Buchin, K, Buchin, M & Wenk, C 2006, Computing the Fr\u00e9chet distance between simple polygons in polynomial time. in N Amenta & O Cheong (eds), Proceedings 22nd Annual ACM Symposium on Computational Geometry (SoCG'06, Sedona AR, USA, June 5-7, 2006). Association for Computing Machinery, Inc., New York NY, pp. 80-87.","raw_type":"info:eu-repo/semantics/conferenceObject"},{"id":"pmh:tue:oai:pure.tue.nl:publications/cfa3452e-37d3-4379-93af-5772235b1a69","is_oa":false,"landing_page_url":"https://research.tue.nl/nl/publications/cfa3452e-37d3-4379-93af-5772235b1a69","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":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Proceedings 22nd Annual ACM Symposium on Computational Geometry (SoCG'06, Sedona AR, USA, June 5-7, 2006), 80 - 87","raw_type":"info:eu-repo/semantics/conferencepaper"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":13,"referenced_works":["https://openalex.org/W161586584","https://openalex.org/W1549357877","https://openalex.org/W1864508826","https://openalex.org/W1979740015","https://openalex.org/W2022754388","https://openalex.org/W2039810899","https://openalex.org/W2083244827","https://openalex.org/W2100318434","https://openalex.org/W2106413026","https://openalex.org/W2124299914","https://openalex.org/W2235929017","https://openalex.org/W2768974198","https://openalex.org/W4235562836"],"related_works":["https://openalex.org/W2466150543","https://openalex.org/W2608536130","https://openalex.org/W1988449797","https://openalex.org/W1812659169","https://openalex.org/W3002409087","https://openalex.org/W4385966043","https://openalex.org/W2362048241","https://openalex.org/W2026465854","https://openalex.org/W2610298441","https://openalex.org/W2022275713"],"abstract_inverted_index":{"We":[0],"present":[1],"the":[2,8,37,44,52],"first":[3],"polynomial-time":[4],"algorithm":[5],"for":[6,10],"computing":[7],"Fr\u00e9chet":[9],"a":[11],"non-trivial":[12],"class":[13],"of":[14,33,43],"surfaces:":[15],"simple":[16],"polygons.":[17],"For":[18],"this,":[19],"we":[20],"show":[21],"that":[22,28,41],"it":[23],"suffices":[24],"to":[25,36,48],"consider":[26],"homeomorphisms":[27],"map":[29],"an":[30],"arbitrary":[31],"triangulation":[32,45],"one":[34],"polygon":[35,39],"other":[38,53],"such":[40],"diagonals":[42],"are":[46],"mapped":[47],"shortest":[49],"paths":[50],"in":[51],"polygon.":[54]},"counts_by_year":[{"year":2021,"cited_by_count":1},{"year":2020,"cited_by_count":4},{"year":2019,"cited_by_count":1},{"year":2018,"cited_by_count":1},{"year":2017,"cited_by_count":1},{"year":2016,"cited_by_count":2},{"year":2015,"cited_by_count":3},{"year":2014,"cited_by_count":4},{"year":2013,"cited_by_count":5},{"year":2012,"cited_by_count":3}],"updated_date":"2026-07-14T23:27:15.235271","created_date":"2025-10-10T00:00:00"}