{"id":"https://openalex.org/W7092295236","doi":"https://doi.org/10.20382/jocg.v16i2a9","title":"Faster Fr\u00e9chet distance approximation through truncated smoothing","display_name":"Faster Fr\u00e9chet distance approximation through truncated smoothing","publication_year":2025,"publication_date":"2025-10-17","ids":{"openalex":"https://openalex.org/W7092295236","doi":"https://doi.org/10.20382/jocg.v16i2a9"},"language":"en","primary_location":{"id":"pmh:oai:ojs.library.carleton.ca:article/5631","is_oa":true,"landing_page_url":"https://jocg.org/index.php/jocg/article/view/5631","pdf_url":null,"source":{"id":"https://openalex.org/S4306400962","display_name":"Journal of Computational Geometry (Carleton University)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I67031392","host_organization_name":"Carleton University","host_organization_lineage":["https://openalex.org/I67031392"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"10.20382/jocg.v16i2","raw_type":"info:eu-repo/semantics/publishedVersion"},"type":"article","indexed_in":["datacite"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://jocg.org/index.php/jocg/article/view/5631","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":null,"display_name":"van der Horst, Thijs","orcid":"https://orcid.org/0009-0002-6987-4489"},"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"]},{"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":true,"raw_author_name":"van der Horst, Thijs","raw_affiliation_strings":["Utrecht University and TU Eindhoven"],"raw_orcid":"https://orcid.org/0009-0002-6987-4489","affiliations":[{"raw_affiliation_string":"Utrecht University and TU Eindhoven","institution_ids":["https://openalex.org/I83019370","https://openalex.org/I193662353"]}]},{"author_position":"middle","author":{"id":null,"display_name":"van Kreveld, Marc","orcid":"https://orcid.org/0000-0001-8208-3468"},"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":["Utrecht University"],"raw_orcid":"https://orcid.org/0000-0001-8208-3468","affiliations":[{"raw_affiliation_string":"Utrecht University","institution_ids":["https://openalex.org/I193662353"]}]},{"author_position":"middle","author":{"id":null,"display_name":"Ophelders, Tim","orcid":"https://orcid.org/0000-0002-9570-024X"},"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"]},{"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":"Ophelders, Tim","raw_affiliation_strings":["Utrecht University and TU Eindhoven"],"raw_orcid":"https://orcid.org/0000-0002-9570-024X","affiliations":[{"raw_affiliation_string":"Utrecht University and TU Eindhoven","institution_ids":["https://openalex.org/I83019370","https://openalex.org/I193662353"]}]},{"author_position":"last","author":{"id":null,"display_name":"Speckmann, Bettina","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":"Speckmann, Bettina","raw_affiliation_strings":["TU Eindhoven"],"raw_orcid":"https://orcid.org/0000-0002-8514-7858","affiliations":[{"raw_affiliation_string":"TU Eindhoven","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","https://openalex.org/I83019370"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":{"value":0.60343063,"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":true,"primary_topic":{"id":"https://openalex.org/T14388","display_name":"Medieval European History and Architecture","score":0.07530000060796738,"subfield":{"id":"https://openalex.org/subfields/1204","display_name":"Archeology"},"field":{"id":"https://openalex.org/fields/12","display_name":"Arts and Humanities"},"domain":{"id":"https://openalex.org/domains/2","display_name":"Social Sciences"}},"topics":[{"id":"https://openalex.org/T14388","display_name":"Medieval European History and Architecture","score":0.07530000060796738,"subfield":{"id":"https://openalex.org/subfields/1204","display_name":"Archeology"},"field":{"id":"https://openalex.org/fields/12","display_name":"Arts and Humanities"},"domain":{"id":"https://openalex.org/domains/2","display_name":"Social Sciences"}},{"id":"https://openalex.org/T14208","display_name":"Death, Funerary Practices, and Mourning","score":0.06019999831914902,"subfield":{"id":"https://openalex.org/subfields/3314","display_name":"Anthropology"},"field":{"id":"https://openalex.org/fields/33","display_name":"Social Sciences"},"domain":{"id":"https://openalex.org/domains/2","display_name":"Social Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/dimension","display_name":"Dimension (graph theory)","score":0.6751000285148621},{"id":"https://openalex.org/keywords/quadratic-equation","display_name":"Quadratic equation","score":0.602400004863739},{"id":"https://openalex.org/keywords/approximation-algorithm","display_name":"Approximation algorithm","score":0.5954999923706055},{"id":"https://openalex.org/keywords/measure","display_name":"Measure (data warehouse)","score":0.588699996471405},{"id":"https://openalex.org/keywords/smoothing","display_name":"Smoothing","score":0.5134000182151794},{"id":"https://openalex.org/keywords/constant","display_name":"Constant (computer programming)","score":0.4422000050544739},{"id":"https://openalex.org/keywords/approximation-theory","display_name":"Approximation theory","score":0.38769999146461487},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.3479999899864197}],"concepts":[{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.7524999976158142},{"id":"https://openalex.org/C33676613","wikidata":"https://www.wikidata.org/wiki/Q13415176","display_name":"Dimension (graph theory)","level":2,"score":0.6751000285148621},{"id":"https://openalex.org/C129844170","wikidata":"https://www.wikidata.org/wiki/Q41299","display_name":"Quadratic equation","level":2,"score":0.602400004863739},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.5954999923706055},{"id":"https://openalex.org/C2780009758","wikidata":"https://www.wikidata.org/wiki/Q6804172","display_name":"Measure (data warehouse)","level":2,"score":0.588699996471405},{"id":"https://openalex.org/C3770464","wikidata":"https://www.wikidata.org/wiki/Q775963","display_name":"Smoothing","level":2,"score":0.5134000182151794},{"id":"https://openalex.org/C2777027219","wikidata":"https://www.wikidata.org/wiki/Q1284190","display_name":"Constant (computer programming)","level":2,"score":0.4422000050544739},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.4011000096797943},{"id":"https://openalex.org/C145242015","wikidata":"https://www.wikidata.org/wiki/Q774123","display_name":"Approximation theory","level":2,"score":0.38769999146461487},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.3783000111579895},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.3479999899864197},{"id":"https://openalex.org/C3017489831","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Running time","level":2,"score":0.3440999984741211},{"id":"https://openalex.org/C2778572836","wikidata":"https://www.wikidata.org/wiki/Q380933","display_name":"Space (punctuation)","level":2,"score":0.32989999651908875},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.3237000107765198},{"id":"https://openalex.org/C28826006","wikidata":"https://www.wikidata.org/wiki/Q33521","display_name":"Applied mathematics","level":1,"score":0.3052999973297119},{"id":"https://openalex.org/C179799912","wikidata":"https://www.wikidata.org/wiki/Q205084","display_name":"Computational complexity theory","level":2,"score":0.2874000072479248},{"id":"https://openalex.org/C119322782","wikidata":"https://www.wikidata.org/wiki/Q2662236","display_name":"VC dimension","level":2,"score":0.27799999713897705},{"id":"https://openalex.org/C29123130","wikidata":"https://www.wikidata.org/wiki/Q874709","display_name":"Computational geometry","level":2,"score":0.26919999718666077},{"id":"https://openalex.org/C2777630202","wikidata":"https://www.wikidata.org/wiki/Q5527840","display_name":"Gaussian measure","level":3,"score":0.2678000032901764},{"id":"https://openalex.org/C2779530757","wikidata":"https://www.wikidata.org/wiki/Q1207505","display_name":"Quality (philosophy)","level":2,"score":0.26669999957084656},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.26660001277923584}],"mesh":[],"locations_count":3,"locations":[{"id":"pmh:oai:ojs.library.carleton.ca:article/5631","is_oa":true,"landing_page_url":"https://jocg.org/index.php/jocg/article/view/5631","pdf_url":null,"source":{"id":"https://openalex.org/S4306400962","display_name":"Journal of Computational Geometry (Carleton University)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I67031392","host_organization_name":"Carleton University","host_organization_lineage":["https://openalex.org/I67031392"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"10.20382/jocg.v16i2","raw_type":"info:eu-repo/semantics/publishedVersion"},{"id":"pmh:oai:pure.tue.nl:openaire/b90c5782-bcfb-4784-890e-4cdb38d753ac","is_oa":true,"landing_page_url":"https://research.tue.nl/en/publications/b90c5782-bcfb-4784-890e-4cdb38d753ac","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":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"van der Horst, T, van Kreveld, M, Ophelders, T A E & Speckmann, B 2025, 'Faster Fr\u00e9chet Distance Approximation Through Truncated Smoothing', Journal of Computational Geometry, vol. 16, no. 2, pp. 265-298. https://doi.org/10.20382/jocg.v16i2a9","raw_type":"info:eu-repo/semantics/publishedVersion"},{"id":"doi:10.20382/jocg.v16i2a9","is_oa":true,"landing_page_url":"https://doi.org/10.20382/jocg.v16i2a9","pdf_url":null,"source":{"id":"https://openalex.org/S4306400962","display_name":"Journal of Computational Geometry (Carleton University)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I67031392","host_organization_name":"Carleton University","host_organization_lineage":["https://openalex.org/I67031392"],"host_organization_lineage_names":[],"type":"repository"},"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":"article-journal"}],"best_oa_location":{"id":"pmh:oai:ojs.library.carleton.ca:article/5631","is_oa":true,"landing_page_url":"https://jocg.org/index.php/jocg/article/view/5631","pdf_url":null,"source":{"id":"https://openalex.org/S4306400962","display_name":"Journal of Computational Geometry (Carleton University)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I67031392","host_organization_name":"Carleton University","host_organization_lineage":["https://openalex.org/I67031392"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"10.20382/jocg.v16i2","raw_type":"info:eu-repo/semantics/publishedVersion"},"sustainable_development_goals":[],"awards":[],"funders":[{"id":"https://openalex.org/F4320321800","display_name":"Nederlandse Organisatie voor Wetenschappelijk Onderzoek","ror":"https://ror.org/04jsz6e67"}],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":0,"referenced_works":[],"related_works":[],"abstract_inverted_index":{"The":[0],"Fr\u00e9chet":[1,13],"distance":[2,7,14],"is":[3],"a":[4,35,56,100,161],"commonly":[5],"used":[6],"measure":[8],"for":[9,80,85,111,126,150],"curves.":[10],"Computing":[11],"the":[12,51,121,141,170,173,185],"between":[15,58],"two":[16],"polygonal":[17],"curves":[18,81,134],"of":[19,50,105,156,172],"$n$":[20],"vertices":[21],"takes":[22],"roughly":[23],"quadratic":[24],"time,":[25,43],"and":[26,61,69],"conditional":[27],"lower":[28],"bounds":[29],"suggest":[30],"that":[31,165],"approximating":[32],"to":[33,144,177],"within":[34],"factor":[36],"$3$":[37],"cannot":[38],"be":[39],"done":[40],"in":[41,45,82,135,166,184],"strongly-subquadratic":[42,123],"even":[44],"one":[46,49,136,167],"dimension.":[47],"Currently,":[48],"best":[52],"approximation":[53,59,187],"algorithms":[54,158],"presents":[55],"trade-off":[57],"quality":[60],"running":[62,103,142],"time.":[63],"Specifically,":[64],"at":[65],"SoCG":[66],"2021,":[67],"Colombe":[68],"Fox":[70],"presented":[71],"an":[72,96],"$O((n^3":[73],"/":[74,107,146,179],"\\alpha^2)":[75],"\\log":[76,109],"n)$-time":[77],"$\\alpha$-approximate":[78,97],"algorithm":[79,98],"arbitrary":[83],"dimensions,":[84],"any":[86,112,127],"$\\alpha":[87,113,151],"\\in":[88,114,130,152],"[\\sqrt{n},":[89],"n]$.":[90,116],"In":[91,117],"this":[92],"work,":[93],"we":[94,119,138],"give":[95,120],"with":[99],"significantly":[101],"faster":[102],"time":[104,143],"$O((n^2":[106,145],"\\alpha)":[108],"n)$,":[110,149],"[1,":[115,153],"particular,":[118],"first":[122],"$n^\\varepsilon$-approximation":[124],"algorithm,":[125],"constant":[128],"$\\varepsilon":[129],"(0,":[131],"1/2]$.":[132],"For":[133],"dimension":[137,168],"further":[139],"improve":[140],"\\alpha^3)":[147],"\\log^2":[148],"n^{1/3}]$.":[154],"Both":[155],"our":[157],"rely":[159],"on":[160],"linear-time":[162],"simplification":[163],"procedure":[164],"reduces":[169],"complexity":[171],"reachable":[174],"free":[175],"space":[176],"$O(n^2":[178],"\\alpha)$":[180],"without":[181],"making":[182],"sacrifices":[183],"asymptotic":[186],"factor.":[188]},"counts_by_year":[],"updated_date":"2026-03-27T05:58:40.876381","created_date":"2025-10-18T00:00:00"}