{"id":"https://openalex.org/W7110224288","doi":"https://doi.org/10.4230/lipics.wads.2025.37","title":"A Near-Linear Time Exact Algorithm for the <i>L<sub>1</sub></i>-Geodesic Fr\u00e9chet Distance Between Two Curves on the Boundary of a Simple Polygon","display_name":"A Near-Linear Time Exact Algorithm for the <i>L<sub>1</sub></i>-Geodesic Fr\u00e9chet Distance Between Two Curves on the Boundary of a Simple Polygon","publication_year":2025,"publication_date":"2025-01-01","ids":{"openalex":"https://openalex.org/W7110224288","doi":"https://doi.org/10.4230/lipics.wads.2025.37"},"language":"en","primary_location":{"id":"pmh:oai:drops-oai.dagstuhl.de:24268","is_oa":true,"landing_page_url":"https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.WADS.2025.37","pdf_url":"https://drops.dagstuhl.de/storage/00lipics/lipics-vol349-wads2025/LIPIcs.WADS.2025.37/LIPIcs.WADS.2025.37.pdf","source":{"id":"https://openalex.org/S4377196569","display_name":"DROPS (Schloss Dagstuhl \u2013 Leibniz Center for Informatics)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I2799853480","host_organization_name":"Schloss Dagstuhl \u2013 Leibniz Center for Informatics","host_organization_lineage":["https://openalex.org/I2799853480"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"publishedVersion"},"type":"article","indexed_in":[],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://drops.dagstuhl.de/storage/00lipics/lipics-vol349-wads2025/LIPIcs.WADS.2025.37/LIPIcs.WADS.2025.37.pdf","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":null,"display_name":"van der Horst, Thijs","orcid":null},"institutions":[{"id":"https://openalex.org/I193662353","display_name":"Utrecht University","ror":"https://ror.org/04pp8hn57","country_code":"NL","type":"education","lineage":["https://openalex.org/I193662353"]}],"countries":["NL"],"is_corresponding":true,"raw_author_name":"van der Horst, Thijs","raw_affiliation_strings":["Department of Information and Computing Sciences, Utrecht University, The Netherlands; Department of Mathematics and Computer Science, TU Eindhoven, The Netherlands"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Information and Computing Sciences, Utrecht University, The Netherlands; Department of Mathematics and Computer Science, TU Eindhoven, The Netherlands","institution_ids":["https://openalex.org/I193662353"]}]},{"author_position":"middle","author":{"id":null,"display_name":"van Kreveld, Marc","orcid":null},"institutions":[{"id":"https://openalex.org/I193662353","display_name":"Utrecht University","ror":"https://ror.org/04pp8hn57","country_code":"NL","type":"education","lineage":["https://openalex.org/I193662353"]}],"countries":["NL"],"is_corresponding":false,"raw_author_name":"van Kreveld, Marc","raw_affiliation_strings":["Department of Information and Computing Sciences, Utrecht University, The Netherlands"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Information and Computing Sciences, Utrecht University, The Netherlands","institution_ids":["https://openalex.org/I193662353"]}]},{"author_position":"middle","author":{"id":null,"display_name":"Ophelders, Tim","orcid":null},"institutions":[{"id":"https://openalex.org/I193662353","display_name":"Utrecht University","ror":"https://ror.org/04pp8hn57","country_code":"NL","type":"education","lineage":["https://openalex.org/I193662353"]}],"countries":["NL"],"is_corresponding":false,"raw_author_name":"Ophelders, Tim","raw_affiliation_strings":["Department of Information and Computing Sciences, Utrecht University, The Netherlands; Department of Mathematics and Computer Science, TU Eindhoven, The Netherlands"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Information and Computing Sciences, Utrecht University, The Netherlands; Department of Mathematics and Computer Science, TU Eindhoven, The Netherlands","institution_ids":["https://openalex.org/I193662353"]}]},{"author_position":"last","author":{"id":null,"display_name":"Speckmann, Bettina","orcid":null},"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":"Speckmann, Bettina","raw_affiliation_strings":["Department of Mathematics and Computer Science, TU Eindhoven, The Netherlands"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Mathematics and Computer Science, TU Eindhoven, The Netherlands","institution_ids":["https://openalex.org/I83019370"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":4,"corresponding_author_ids":[],"corresponding_institution_ids":["https://openalex.org/I193662353"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":true,"cited_by_count":0,"citation_normalized_percentile":{"value":0.7050737,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":null,"last_page":null},"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.8503999710083008,"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.8503999710083008,"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/T10304","display_name":"Geometric and Algebraic Topology","score":0.03660000115633011,"subfield":{"id":"https://openalex.org/subfields/2608","display_name":"Geometry and Topology"},"field":{"id":"https://openalex.org/fields/26","display_name":"Mathematics"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T12536","display_name":"Topological and Geometric Data Analysis","score":0.0142000000923872,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"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/disjoint-sets","display_name":"Disjoint sets","score":0.744700014591217},{"id":"https://openalex.org/keywords/boundary","display_name":"Boundary (topology)","score":0.7196000218391418},{"id":"https://openalex.org/keywords/geodesic","display_name":"Geodesic","score":0.7152000069618225},{"id":"https://openalex.org/keywords/polygon","display_name":"Polygon (computer graphics)","score":0.6434999704360962},{"id":"https://openalex.org/keywords/simple-polygon","display_name":"Simple polygon","score":0.5536999702453613},{"id":"https://openalex.org/keywords/simple","display_name":"Simple (philosophy)","score":0.38040000200271606},{"id":"https://openalex.org/keywords/computational-geometry","display_name":"Computational geometry","score":0.34689998626708984},{"id":"https://openalex.org/keywords/polygon-covering","display_name":"Polygon covering","score":0.31310001015663147}],"concepts":[{"id":"https://openalex.org/C45340560","wikidata":"https://www.wikidata.org/wiki/Q215382","display_name":"Disjoint sets","level":2,"score":0.744700014591217},{"id":"https://openalex.org/C62354387","wikidata":"https://www.wikidata.org/wiki/Q875399","display_name":"Boundary (topology)","level":2,"score":0.7196000218391418},{"id":"https://openalex.org/C165818556","wikidata":"https://www.wikidata.org/wiki/Q213488","display_name":"Geodesic","level":2,"score":0.7152000069618225},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.6747999787330627},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.645799994468689},{"id":"https://openalex.org/C190694206","wikidata":"https://www.wikidata.org/wiki/Q3276654","display_name":"Polygon (computer graphics)","level":3,"score":0.6434999704360962},{"id":"https://openalex.org/C197949415","wikidata":"https://www.wikidata.org/wiki/Q782746","display_name":"Simple polygon","level":3,"score":0.5536999702453613},{"id":"https://openalex.org/C2780586882","wikidata":"https://www.wikidata.org/wiki/Q7520643","display_name":"Simple (philosophy)","level":2,"score":0.38040000200271606},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.3772999942302704},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.35899999737739563},{"id":"https://openalex.org/C29123130","wikidata":"https://www.wikidata.org/wiki/Q874709","display_name":"Computational geometry","level":2,"score":0.34689998626708984},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.3176000118255615},{"id":"https://openalex.org/C187778580","wikidata":"https://www.wikidata.org/wiki/Q18389289","display_name":"Polygon covering","level":3,"score":0.31310001015663147},{"id":"https://openalex.org/C2834757","wikidata":"https://www.wikidata.org/wiki/Q4925424","display_name":"Monotone polygon","level":2,"score":0.3091000020503998},{"id":"https://openalex.org/C182860218","wikidata":"https://www.wikidata.org/wiki/Q633674","display_name":"Polygonal chain","level":3,"score":0.29750001430511475},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.2957000136375427},{"id":"https://openalex.org/C63553672","wikidata":"https://www.wikidata.org/wiki/Q581168","display_name":"Binary logarithm","level":2,"score":0.290800005197525},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.28769999742507935},{"id":"https://openalex.org/C58315980","wikidata":"https://www.wikidata.org/wiki/Q179436","display_name":"Asymptote","level":2,"score":0.27709999680519104},{"id":"https://openalex.org/C97542219","wikidata":"https://www.wikidata.org/wiki/Q497863","display_name":"SIMPLE algorithm","level":2,"score":0.2702000141143799},{"id":"https://openalex.org/C112680207","wikidata":"https://www.wikidata.org/wiki/Q714886","display_name":"Regular polygon","level":2,"score":0.26980000734329224},{"id":"https://openalex.org/C2776799497","wikidata":"https://www.wikidata.org/wiki/Q484298","display_name":"Surface (topology)","level":2,"score":0.2685000002384186}],"mesh":[],"locations_count":2,"locations":[{"id":"pmh:oai:drops-oai.dagstuhl.de:24268","is_oa":true,"landing_page_url":"https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.WADS.2025.37","pdf_url":"https://drops.dagstuhl.de/storage/00lipics/lipics-vol349-wads2025/LIPIcs.WADS.2025.37/LIPIcs.WADS.2025.37.pdf","source":{"id":"https://openalex.org/S4377196569","display_name":"DROPS (Schloss Dagstuhl \u2013 Leibniz Center for Informatics)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I2799853480","host_organization_name":"Schloss Dagstuhl \u2013 Leibniz Center for Informatics","host_organization_lineage":["https://openalex.org/I2799853480"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"publishedVersion"},{"id":"pmh:oai:pure.tue.nl:openaire_cris_publications/634b9631-0132-4bb7-8802-e8d88a8b7087","is_oa":true,"landing_page_url":"https://research.tue.nl/en/publications/634b9631-0132-4bb7-8802-e8d88a8b7087","pdf_url":"https://pure.tue.nl/ws/files/370267957/LIPIcs.WADS.2025.37.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":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"van der Horst, T, van Kreveld, M, Ophelders, T A E & Speckmann, B 2025, A Near-Linear Time Exact Algorithm for the L 1 -Geodesic Fr\u00e9chet Distance Between Two Curves on the Boundary of a Simple Polygon. in P Morin & E Oh (eds), 19th International Symposium on Algorithms and Data Structures (WADS 2025)., 37, Leibniz International Proceedings in Informatics, LIPIcs, vol. 349, Schloss Dagstuhl - Leibniz-Zentrum f\u00fcr Informatik, pp. 37:1-37:13, 19th International Symposium on Algorithms and Data Structures, WADS 2025, Toronto, Canada, 11/08/25. https://doi.org/10.4230/LIPIcs.WADS.2025.37","raw_type":"info:eu-repo/semantics/publishedVersion"}],"best_oa_location":{"id":"pmh:oai:drops-oai.dagstuhl.de:24268","is_oa":true,"landing_page_url":"https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.WADS.2025.37","pdf_url":"https://drops.dagstuhl.de/storage/00lipics/lipics-vol349-wads2025/LIPIcs.WADS.2025.37/LIPIcs.WADS.2025.37.pdf","source":{"id":"https://openalex.org/S4377196569","display_name":"DROPS (Schloss Dagstuhl \u2013 Leibniz Center for Informatics)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I2799853480","host_organization_name":"Schloss Dagstuhl \u2013 Leibniz Center for Informatics","host_organization_lineage":["https://openalex.org/I2799853480"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"publishedVersion"},"sustainable_development_goals":[{"score":0.45075201988220215,"id":"https://metadata.un.org/sdg/11","display_name":"Sustainable cities and communities"}],"awards":[],"funders":[{"id":"https://openalex.org/F4320321800","display_name":"Nederlandse Organisatie voor Wetenschappelijk Onderzoek","ror":"https://ror.org/04jsz6e67"}],"has_content":{"grobid_xml":true,"pdf":true},"content_urls":{"pdf":"https://content.openalex.org/works/W7110224288.pdf","grobid_xml":"https://content.openalex.org/works/W7110224288.grobid-xml"},"referenced_works_count":0,"referenced_works":[],"related_works":[],"abstract_inverted_index":{"Let":[0,8],"P":[1,45],"be":[2,12],"a":[3],"polygon":[4],"with":[5,23],"k":[6,55],"vertices.":[7,27],"R":[9,37],"and":[10,25,38],"B":[11,39],"two":[13],"simple,":[14],"interior":[15],"disjoint":[16],"curves":[17],"on":[18],"the":[19,33,41],"boundary":[20],"of":[21],"P,":[22],"n":[24],"m":[26],"We":[28],"show":[29],"how":[30],"to":[31],"compute":[32],"Fr\u00e9chet":[34],"distance":[35],"between":[36],"using":[40],"geodesic":[42],"L\u2081-distance":[43],"in":[44,46],"(k":[47],"log":[48,54],"nm":[49,53],"+":[50,56],"(n+m)":[51],"(log\u00b2":[52],"log\u2074":[57],"nm))":[58],"time.":[59]},"counts_by_year":[],"updated_date":"2026-05-21T09:19:25.381259","created_date":"2025-12-08T00:00:00"}