{"id":"https://openalex.org/W7162488945","doi":"https://doi.org/10.4230/lipics.socg.2026.35","title":"On Computing the (Exact) Fr\u00e9chet Distance with a Frog","display_name":"On Computing the (Exact) Fr\u00e9chet Distance with a Frog","publication_year":2026,"publication_date":"2026-01-01","ids":{"openalex":"https://openalex.org/W7162488945","doi":"https://doi.org/10.4230/lipics.socg.2026.35"},"language":"en","primary_location":{"id":"pmh:oai:drops-oai.dagstuhl.de:25841","is_oa":true,"landing_page_url":"https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SoCG.2026.35","pdf_url":"https://drops.dagstuhl.de/storage/00lipics/lipics-vol367-socg2026/LIPIcs.SoCG.2026.35/LIPIcs.SoCG.2026.35.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":"InProceedings"},"type":"article","indexed_in":["datacite"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://drops.dagstuhl.de/storage/00lipics/lipics-vol367-socg2026/LIPIcs.SoCG.2026.35/LIPIcs.SoCG.2026.35.pdf","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5007972675","display_name":"Jacobus Conradi","orcid":"https://orcid.org/0000-0002-8259-1187"},"institutions":[{"id":"https://openalex.org/I124055696","display_name":"University of Copenhagen","ror":"https://ror.org/035b05819","country_code":"DK","type":"education","lineage":["https://openalex.org/I124055696"]}],"countries":["DK"],"is_corresponding":false,"raw_author_name":"Conradi, Jacobus","raw_affiliation_strings":["Department of Computer Science, University of Copenhagen, Denmark"],"raw_orcid":"https://orcid.org/0000-0002-8259-1187","affiliations":[{"raw_affiliation_string":"Department of Computer Science, University of Copenhagen, Denmark","institution_ids":["https://openalex.org/I124055696"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5137151056","display_name":"Ivor van der Hoog","orcid":"https://orcid.org/0009-0006-2624-0231"},"institutions":[{"id":"https://openalex.org/I83467386","display_name":"IT University of Copenhagen","ror":"https://ror.org/02309jg23","country_code":"DK","type":"education","lineage":["https://openalex.org/I83467386"]}],"countries":["DK"],"is_corresponding":false,"raw_author_name":"van der Hoog, Ivor","raw_affiliation_strings":["IT University of Copenhagen, Denmark"],"raw_orcid":"https://orcid.org/0009-0006-2624-0231","affiliations":[{"raw_affiliation_string":"IT University of Copenhagen, Denmark","institution_ids":["https://openalex.org/I83467386"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5137153766","display_name":"Eva Rotenberg","orcid":"https://orcid.org/0000-0001-5853-7909"},"institutions":[{"id":"https://openalex.org/I83467386","display_name":"IT University of Copenhagen","ror":"https://ror.org/02309jg23","country_code":"DK","type":"education","lineage":["https://openalex.org/I83467386"]}],"countries":["DK"],"is_corresponding":false,"raw_author_name":"Rotenberg, Eva","raw_affiliation_strings":["IT University of Copenhagen, Denmark"],"raw_orcid":"https://orcid.org/0000-0001-5853-7909","affiliations":[{"raw_affiliation_string":"IT University of Copenhagen, Denmark","institution_ids":["https://openalex.org/I83467386"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":true,"cited_by_count":0,"citation_normalized_percentile":{"value":0.63038339,"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/T12292","display_name":"Graph Theory and Algorithms","score":0.2289000004529953,"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"}},"topics":[{"id":"https://openalex.org/T12292","display_name":"Graph Theory and Algorithms","score":0.2289000004529953,"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"}},{"id":"https://openalex.org/T10126","display_name":"Logic, programming, and type systems","score":0.13249999284744263,"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/T10317","display_name":"Advanced Database Systems and Queries","score":0.09600000083446503,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"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/tree-traversal","display_name":"Tree traversal","score":0.5460000038146973},{"id":"https://openalex.org/keywords/heuristic","display_name":"Heuristic","score":0.5410000085830688},{"id":"https://openalex.org/keywords/convergence","display_name":"Convergence (economics)","score":0.5260000228881836},{"id":"https://openalex.org/keywords/overhead","display_name":"Overhead (engineering)","score":0.48089998960494995},{"id":"https://openalex.org/keywords/monotonic-function","display_name":"Monotonic function","score":0.4431999921798706},{"id":"https://openalex.org/keywords/suite","display_name":"Suite","score":0.4316999912261963},{"id":"https://openalex.org/keywords/computation","display_name":"Computation","score":0.42980000376701355},{"id":"https://openalex.org/keywords/implementation","display_name":"Implementation","score":0.4124000072479248},{"id":"https://openalex.org/keywords/lossless-compression","display_name":"Lossless compression","score":0.41190001368522644}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5561000108718872},{"id":"https://openalex.org/C140745168","wikidata":"https://www.wikidata.org/wiki/Q1210082","display_name":"Tree traversal","level":2,"score":0.5460000038146973},{"id":"https://openalex.org/C173801870","wikidata":"https://www.wikidata.org/wiki/Q201413","display_name":"Heuristic","level":2,"score":0.5410000085830688},{"id":"https://openalex.org/C2777303404","wikidata":"https://www.wikidata.org/wiki/Q759757","display_name":"Convergence (economics)","level":2,"score":0.5260000228881836},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.5059000253677368},{"id":"https://openalex.org/C2779960059","wikidata":"https://www.wikidata.org/wiki/Q7113681","display_name":"Overhead (engineering)","level":2,"score":0.48089998960494995},{"id":"https://openalex.org/C72169020","wikidata":"https://www.wikidata.org/wiki/Q194404","display_name":"Monotonic function","level":2,"score":0.4431999921798706},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.44209998846054077},{"id":"https://openalex.org/C79581498","wikidata":"https://www.wikidata.org/wiki/Q1367530","display_name":"Suite","level":2,"score":0.4316999912261963},{"id":"https://openalex.org/C45374587","wikidata":"https://www.wikidata.org/wiki/Q12525525","display_name":"Computation","level":2,"score":0.42980000376701355},{"id":"https://openalex.org/C26713055","wikidata":"https://www.wikidata.org/wiki/Q245962","display_name":"Implementation","level":2,"score":0.4124000072479248},{"id":"https://openalex.org/C81081738","wikidata":"https://www.wikidata.org/wiki/Q55542","display_name":"Lossless compression","level":3,"score":0.41190001368522644},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.39410001039505005},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.37700000405311584},{"id":"https://openalex.org/C127705205","wikidata":"https://www.wikidata.org/wiki/Q5748245","display_name":"Heuristics","level":2,"score":0.37619999051094055},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.3476000130176544},{"id":"https://openalex.org/C75553542","wikidata":"https://www.wikidata.org/wiki/Q178161","display_name":"A priori and a posteriori","level":2,"score":0.33180001378059387},{"id":"https://openalex.org/C162319229","wikidata":"https://www.wikidata.org/wiki/Q175263","display_name":"Data structure","level":2,"score":0.328000009059906},{"id":"https://openalex.org/C157544257","wikidata":"https://www.wikidata.org/wiki/Q866300","display_name":"Bisection method","level":2,"score":0.3091000020503998},{"id":"https://openalex.org/C54829058","wikidata":"https://www.wikidata.org/wiki/Q172937","display_name":"Polyhedron","level":2,"score":0.2921000123023987},{"id":"https://openalex.org/C77618280","wikidata":"https://www.wikidata.org/wiki/Q1155772","display_name":"Scheme (mathematics)","level":2,"score":0.2921000123023987},{"id":"https://openalex.org/C177148314","wikidata":"https://www.wikidata.org/wiki/Q170084","display_name":"Generalization","level":2,"score":0.2822999954223633},{"id":"https://openalex.org/C12713177","wikidata":"https://www.wikidata.org/wiki/Q1900281","display_name":"Perspective (graphical)","level":2,"score":0.2800999879837036},{"id":"https://openalex.org/C148043351","wikidata":"https://www.wikidata.org/wiki/Q4456944","display_name":"Current (fluid)","level":2,"score":0.2757999897003174},{"id":"https://openalex.org/C57869625","wikidata":"https://www.wikidata.org/wiki/Q1783502","display_name":"Rate of convergence","level":3,"score":0.2653000056743622},{"id":"https://openalex.org/C168065819","wikidata":"https://www.wikidata.org/wiki/Q845566","display_name":"Debugging","level":2,"score":0.2606000006198883},{"id":"https://openalex.org/C200331156","wikidata":"https://www.wikidata.org/wiki/Q506041","display_name":"Jacobian matrix and determinant","level":2,"score":0.25999999046325684},{"id":"https://openalex.org/C96333769","wikidata":"https://www.wikidata.org/wiki/Q907955","display_name":"Graph traversal","level":3,"score":0.25589999556541443},{"id":"https://openalex.org/C68339613","wikidata":"https://www.wikidata.org/wiki/Q1549489","display_name":"Speedup","level":2,"score":0.2549999952316284},{"id":"https://openalex.org/C167729594","wikidata":"https://www.wikidata.org/wiki/Q17736","display_name":"Axiom","level":2,"score":0.2540999948978424},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.2508000135421753}],"mesh":[],"locations_count":3,"locations":[{"id":"pmh:oai:drops-oai.dagstuhl.de:25841","is_oa":true,"landing_page_url":"https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SoCG.2026.35","pdf_url":"https://drops.dagstuhl.de/storage/00lipics/lipics-vol367-socg2026/LIPIcs.SoCG.2026.35/LIPIcs.SoCG.2026.35.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":"InProceedings"},{"id":"pmh:oai:pure.atira.dk:openaire_cris_publications/dc7de141-a159-49bb-8b2a-e59d1e411259","is_oa":true,"landing_page_url":"https://researchprofiles.ku.dk/da/publications/dc7de141-a159-49bb-8b2a-e59d1e411259","pdf_url":"https://curis.ku.dk/ws/files/553758183/On_Computing.pdf","source":{"id":"https://openalex.org/S4306401983","display_name":"Research at the University of Copenhagen (University of Copenhagen)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I124055696","host_organization_name":"University of Copenhagen","host_organization_lineage":["https://openalex.org/I124055696"],"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":"contributionToPeriodical"},{"id":"doi:10.4230/lipics.socg.2026.35","is_oa":true,"landing_page_url":"https://doi.org/10.4230/lipics.socg.2026.35","pdf_url":null,"source":null,"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":null,"is_accepted":false,"is_published":null,"raw_source_name":null,"raw_type":"ConferencePaper"}],"best_oa_location":{"id":"pmh:oai:drops-oai.dagstuhl.de:25841","is_oa":true,"landing_page_url":"https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SoCG.2026.35","pdf_url":"https://drops.dagstuhl.de/storage/00lipics/lipics-vol367-socg2026/LIPIcs.SoCG.2026.35/LIPIcs.SoCG.2026.35.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":"InProceedings"},"sustainable_development_goals":[],"awards":[{"id":"https://openalex.org/G5709038784","display_name":null,"funder_award_id":"37507","funder_id":"https://openalex.org/F4320310490","funder_display_name":"Villum Fonden"}],"funders":[{"id":"https://openalex.org/F4320310490","display_name":"Villum Fonden","ror":"https://ror.org/007ww2d15"}],"has_content":{"pdf":true,"grobid_xml":true},"content_urls":{"pdf":"https://content.openalex.org/works/W7162488945.pdf","grobid_xml":"https://content.openalex.org/works/W7162488945.grobid-xml"},"referenced_works_count":0,"referenced_works":[],"related_works":[],"abstract_inverted_index":{"The":[0],"continuous":[1,61],"Fr\u00e9chet":[2,118],"distance":[3,57,119],"\ud835\udc9f_F(\u03c0,\u03c3)":[4,34],"between":[5],"two":[6,23],"polygonal":[7],"curves":[8],"\u03c0":[9,48],"and":[10,49,68,124,149,178,191,249],"\u03c3":[11],"is":[12,133,165,199],"classically":[13],"computed":[14],"by":[15,35,137],"exploring":[16],"the":[17,22,55,60,78,111,117,122,183,203,211,222,247],"free":[18],"space":[19],"diagram":[20],"over":[21],"curves.":[24],"[SoCG'25]":[25],"recently":[26],"proposed":[27],"a":[28,39,44,128,171,242],"radically":[29],"different":[30],"approach:":[31],"they":[32],"approximate":[33],"computing":[36],"paths":[37],"in":[38,91,121,202,230],"discrete":[40,56],"graph":[41],"that":[42,70,144],"models":[43],"joint":[45],"traversal":[46],"of":[47,159,176,224,251],"\u03c3,":[50],"recursively":[51],"bisecting":[52],"edges":[53],"until":[54],"converges":[58],"to":[59,77,115,215],"one.":[62],"They":[63],"implement":[64],"their":[65],"\"frog-based\"":[66],"technique,":[67],"claim":[69],"it":[71,95,100,126],"yields":[72],"substantial":[73],"practical":[74,263],"speedups":[75],"compared":[76],"state-of-the-art":[79],"implementations.":[80],"In":[81],"this":[82,86,233],"paper,":[83],"we":[84,140,254],"revisit":[85],"technique.":[87],"We":[88,153],"observe":[89],"that,":[90],"its":[92,107,216,256,261],"current":[93],"form,":[94],"has":[96],"three":[97],"limitations:":[98],"(i)":[99],"does":[101],"not":[102],"use":[103],"exact":[104,186],"arithmetic,":[105],"(ii)":[106],"recursive":[108],"bisection":[109],"introduces":[110,189],"required":[112],"monotonicity":[113],"events":[114],"realise":[116],"only":[120],"limit,":[123],"(iii)":[125],"applies":[127],"heuristic":[129],"simplification":[130],"technique":[131],"which":[132],"overly":[134],"conservative.":[135],"Motivated":[136],"theoretical":[138,257],"interest,":[139],"develop":[141],"new":[142,197],"techniques":[143],"guarantee":[145],"exactness,":[146],"polynomial-time":[147],"convergence":[148,218],"near-optimal":[150],"lossless":[151],"simplifications.":[152],"provide":[154,241],"an":[155,166],"open-source":[156],"C++":[157],"implementation":[158,223],"our":[160,196],"variant.":[161],"Our":[162],"primary":[163],"contribution":[164],"extensive":[167],"empirical":[168],"evaluation":[169],"on":[170,246],"broad,":[172],"publically":[173],"available,":[174],"suite":[175],"real-world":[177],"synthetic":[179],"data":[180],"sets.":[181],"Among":[182],"frog-based":[184,228,252],"variants,":[185],"computation":[187],"indeed":[188],"overhead":[190],"increases":[192],"median":[193],"runtime.":[194],"Yet,":[195],"approach":[198],"often":[200],"faster":[201],"worst":[204,206],"case,":[205],"ten":[207],"percent,":[208],"or":[209],"even":[210],"average":[212],"runtime":[213],"due":[214],"worst-case":[217],"guarantees.":[219],"More":[220],"surprisingly,":[221],"[SoCG'19]":[225],"dominates":[226],"all":[227],"implementations":[229],"performance":[231],"-":[232],"finding":[234],"contrasts":[235],"previously":[236],"published":[237],"claims.":[238],"These":[239],"results":[240],"much-needed":[243],"nuanced":[244],"perspective":[245],"capabilities":[248],"limitations":[250],"techniques:":[253],"showcase":[255],"appeal,":[258],"but":[259],"highlight":[260],"limited":[262],"feasibility.":[264]},"counts_by_year":[],"updated_date":"2026-07-28T07:46:37.118299","created_date":"2026-05-28T00:00:00"}