{"id":"https://openalex.org/W3080433236","doi":"https://doi.org/10.1145/3397518","title":"Products of Euclidean Metrics, Applied to Proximity Problems among Curves","display_name":"Products of Euclidean Metrics, Applied to Proximity Problems among Curves","publication_year":2020,"publication_date":"2020-06-21","ids":{"openalex":"https://openalex.org/W3080433236","doi":"https://doi.org/10.1145/3397518","mag":"3080433236"},"language":"en","primary_location":{"id":"doi:10.1145/3397518","is_oa":false,"landing_page_url":"https://doi.org/10.1145/3397518","pdf_url":null,"source":{"id":"https://openalex.org/S2503711797","display_name":"ACM Transactions on Spatial Algorithms and Systems","issn_l":"2374-0353","issn":["2374-0353","2374-0361"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319798","host_organization_name":"Association for Computing Machinery","host_organization_lineage":["https://openalex.org/P4310319798"],"host_organization_lineage_names":["Association for Computing Machinery"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"ACM Transactions on Spatial Algorithms and Systems","raw_type":"journal-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://inria.hal.science/hal-03045134v1/file/main.pdf","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5087662998","display_name":"Ioannis Z. Emiris","orcid":"https://orcid.org/0000-0002-2339-5303"},"institutions":[{"id":"https://openalex.org/I200777214","display_name":"National and Kapodistrian University of Athens","ror":"https://ror.org/04gnjpq42","country_code":"GR","type":"education","lineage":["https://openalex.org/I200777214"]},{"id":"https://openalex.org/I4210156054","display_name":"Athena Research and Innovation Center In Information Communication & Knowledge Technologies","ror":"https://ror.org/0576by029","country_code":"GR","type":"facility","lineage":["https://openalex.org/I4210156054"]}],"countries":["GR"],"is_corresponding":false,"raw_author_name":"Ioannis Z. Emiris","raw_affiliation_strings":["Department of Informatics 8 Telecommunications, National 8 Kapodistrian University of Athens, and ATHENA Research 8 Innovation Center, Maroussi, Greece","AROMATH - AlgebRe, geOmetrie, Modelisation et AlgoriTHmes (2004 route des Lucioles BP 93 06902 Sophia Antipolis cedex - France)"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Informatics 8 Telecommunications, National 8 Kapodistrian University of Athens, and ATHENA Research 8 Innovation Center, Maroussi, Greece","institution_ids":["https://openalex.org/I4210156054","https://openalex.org/I200777214"]},{"raw_affiliation_string":"AROMATH - AlgebRe, geOmetrie, Modelisation et AlgoriTHmes (2004 route des Lucioles BP 93 06902 Sophia Antipolis cedex - France)","institution_ids":[]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5073693999","display_name":"Ioannis Psarros","orcid":"https://orcid.org/0000-0002-5079-5003"},"institutions":[{"id":"https://openalex.org/I200777214","display_name":"National and Kapodistrian University of Athens","ror":"https://ror.org/04gnjpq42","country_code":"GR","type":"education","lineage":["https://openalex.org/I200777214"]}],"countries":["GR"],"is_corresponding":false,"raw_author_name":"Ioannis Psarros","raw_affiliation_strings":["Department of Informatics 8 Telecommunications, National 8 Kapodistrian University of Athens, Panepistimiopolis, Athens, Greece","AROMATH - AlgebRe, geOmetrie, Modelisation et AlgoriTHmes (2004 route des Lucioles BP 93 06902 Sophia Antipolis cedex - France)"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Informatics 8 Telecommunications, National 8 Kapodistrian University of Athens, Panepistimiopolis, Athens, Greece","institution_ids":["https://openalex.org/I200777214"]},{"raw_affiliation_string":"AROMATH - AlgebRe, geOmetrie, Modelisation et AlgoriTHmes (2004 route des Lucioles BP 93 06902 Sophia Antipolis cedex - France)","institution_ids":[]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.4562,"has_fulltext":true,"cited_by_count":3,"citation_normalized_percentile":{"value":0.61459692,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":96,"max":97},"biblio":{"volume":"6","issue":"4","first_page":"1","last_page":"20"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11106","display_name":"Data Management and Algorithms","score":0.9998000264167786,"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"}},"topics":[{"id":"https://openalex.org/T11106","display_name":"Data Management and Algorithms","score":0.9998000264167786,"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/T13282","display_name":"Automated Road and Building Extraction","score":0.9940999746322632,"subfield":{"id":"https://openalex.org/subfields/2212","display_name":"Ocean Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10757","display_name":"Geographic Information Systems Studies","score":0.9909999966621399,"subfield":{"id":"https://openalex.org/subfields/3305","display_name":"Geography, Planning and Development"},"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/discretization","display_name":"Discretization","score":0.5869393348693848},{"id":"https://openalex.org/keywords/dimension","display_name":"Dimension (graph theory)","score":0.5837317705154419},{"id":"https://openalex.org/keywords/euclidean-space","display_name":"Euclidean space","score":0.5547526478767395},{"id":"https://openalex.org/keywords/focus","display_name":"Focus (optics)","score":0.5539426803588867},{"id":"https://openalex.org/keywords/computational-geometry","display_name":"Computational geometry","score":0.518701434135437},{"id":"https://openalex.org/keywords/nearest-neighbor-search","display_name":"Nearest neighbor search","score":0.4980762004852295},{"id":"https://openalex.org/keywords/range","display_name":"Range (aeronautics)","score":0.481175035238266},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.4807579219341278},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.46811622381210327},{"id":"https://openalex.org/keywords/k-nearest-neighbors-algorithm","display_name":"k-nearest neighbors algorithm","score":0.4679044187068939},{"id":"https://openalex.org/keywords/euclidean-distance","display_name":"Euclidean distance","score":0.4582693874835968},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.4287137985229492},{"id":"https://openalex.org/keywords/dynamic-time-warping","display_name":"Dynamic time warping","score":0.4263978600502014},{"id":"https://openalex.org/keywords/bounded-function","display_name":"Bounded function","score":0.4239300489425659},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.14488479495048523},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.13579624891281128},{"id":"https://openalex.org/keywords/geometry","display_name":"Geometry","score":0.12344905734062195},{"id":"https://openalex.org/keywords/mathematical-analysis","display_name":"Mathematical analysis","score":0.10886767506599426}],"concepts":[{"id":"https://openalex.org/C73000952","wikidata":"https://www.wikidata.org/wiki/Q17007827","display_name":"Discretization","level":2,"score":0.5869393348693848},{"id":"https://openalex.org/C33676613","wikidata":"https://www.wikidata.org/wiki/Q13415176","display_name":"Dimension (graph theory)","level":2,"score":0.5837317705154419},{"id":"https://openalex.org/C186450821","wikidata":"https://www.wikidata.org/wiki/Q17295","display_name":"Euclidean space","level":2,"score":0.5547526478767395},{"id":"https://openalex.org/C192209626","wikidata":"https://www.wikidata.org/wiki/Q190909","display_name":"Focus (optics)","level":2,"score":0.5539426803588867},{"id":"https://openalex.org/C29123130","wikidata":"https://www.wikidata.org/wiki/Q874709","display_name":"Computational geometry","level":2,"score":0.518701434135437},{"id":"https://openalex.org/C116738811","wikidata":"https://www.wikidata.org/wiki/Q608751","display_name":"Nearest neighbor search","level":2,"score":0.4980762004852295},{"id":"https://openalex.org/C204323151","wikidata":"https://www.wikidata.org/wiki/Q905424","display_name":"Range (aeronautics)","level":2,"score":0.481175035238266},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.4807579219341278},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.46811622381210327},{"id":"https://openalex.org/C113238511","wikidata":"https://www.wikidata.org/wiki/Q1071612","display_name":"k-nearest neighbors algorithm","level":2,"score":0.4679044187068939},{"id":"https://openalex.org/C120174047","wikidata":"https://www.wikidata.org/wiki/Q847073","display_name":"Euclidean distance","level":2,"score":0.4582693874835968},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.4287137985229492},{"id":"https://openalex.org/C88516994","wikidata":"https://www.wikidata.org/wiki/Q1268863","display_name":"Dynamic time warping","level":2,"score":0.4263978600502014},{"id":"https://openalex.org/C34388435","wikidata":"https://www.wikidata.org/wiki/Q2267362","display_name":"Bounded function","level":2,"score":0.4239300489425659},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.14488479495048523},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.13579624891281128},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.12344905734062195},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.10886767506599426},{"id":"https://openalex.org/C120665830","wikidata":"https://www.wikidata.org/wiki/Q14620","display_name":"Optics","level":1,"score":0.0},{"id":"https://openalex.org/C192562407","wikidata":"https://www.wikidata.org/wiki/Q228736","display_name":"Materials science","level":0,"score":0.0},{"id":"https://openalex.org/C121332964","wikidata":"https://www.wikidata.org/wiki/Q413","display_name":"Physics","level":0,"score":0.0},{"id":"https://openalex.org/C159985019","wikidata":"https://www.wikidata.org/wiki/Q181790","display_name":"Composite material","level":1,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1145/3397518","is_oa":false,"landing_page_url":"https://doi.org/10.1145/3397518","pdf_url":null,"source":{"id":"https://openalex.org/S2503711797","display_name":"ACM Transactions on Spatial Algorithms and Systems","issn_l":"2374-0353","issn":["2374-0353","2374-0361"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319798","host_organization_name":"Association for Computing Machinery","host_organization_lineage":["https://openalex.org/P4310319798"],"host_organization_lineage_names":["Association for Computing Machinery"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"ACM Transactions on Spatial Algorithms and Systems","raw_type":"journal-article"},{"id":"pmh:oai:HAL:hal-03045134v1","is_oa":true,"landing_page_url":"https://inria.hal.science/hal-03045134","pdf_url":"https://inria.hal.science/hal-03045134v1/file/main.pdf","source":{"id":"https://openalex.org/S4306402512","display_name":"HAL (Le Centre pour la Communication Scientifique Directe)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I1294671590","host_organization_name":"Centre National de la Recherche Scientifique","host_organization_lineage":["https://openalex.org/I1294671590"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"ACM Transactions on Spatial Algorithms and Systems, 2020, 6 (4), pp.1-20. &#x27E8;10.1145/3397518&#x27E9;","raw_type":"Journal articles"}],"best_oa_location":{"id":"pmh:oai:HAL:hal-03045134v1","is_oa":true,"landing_page_url":"https://inria.hal.science/hal-03045134","pdf_url":"https://inria.hal.science/hal-03045134v1/file/main.pdf","source":{"id":"https://openalex.org/S4306402512","display_name":"HAL (Le Centre pour la Communication Scientifique Directe)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I1294671590","host_organization_name":"Centre National de la Recherche Scientifique","host_organization_lineage":["https://openalex.org/I1294671590"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"ACM Transactions on Spatial Algorithms and Systems, 2020, 6 (4), pp.1-20. &#x27E8;10.1145/3397518&#x27E9;","raw_type":"Journal articles"},"sustainable_development_goals":[{"score":0.4399999976158142,"display_name":"Sustainable cities and communities","id":"https://metadata.un.org/sdg/11"}],"awards":[{"id":"https://openalex.org/G3420432594","display_name":null,"funder_award_id":"MIS-5000432","funder_id":"https://openalex.org/F4320320300","funder_display_name":"European Commission"},{"id":"https://openalex.org/G4937468798","display_name":null,"funder_award_id":"H2020","funder_id":"https://openalex.org/F4320320300","funder_display_name":"European Commission"},{"id":"https://openalex.org/G7182338872","display_name":null,"funder_award_id":"5000432","funder_id":"https://openalex.org/F4320321916","funder_display_name":"State Scholarships Foundation"},{"id":"https://openalex.org/G7284267116","display_name":"Learning and Analysing Massive / Big complex Data","funder_award_id":"734242","funder_id":"https://openalex.org/F4320320300","funder_display_name":"European Commission"}],"funders":[{"id":"https://openalex.org/F4320320300","display_name":"European Commission","ror":"https://ror.org/00k4n6c32"},{"id":"https://openalex.org/F4320321916","display_name":"State Scholarships Foundation","ror":"https://ror.org/023z3dm33"},{"id":"https://openalex.org/F4320332999","display_name":"Horizon 2020 Framework Programme","ror":"https://ror.org/00k4n6c32"}],"has_content":{"pdf":true,"grobid_xml":true},"content_urls":{"pdf":"https://content.openalex.org/works/W3080433236.pdf","grobid_xml":"https://content.openalex.org/works/W3080433236.grobid-xml"},"referenced_works_count":22,"referenced_works":["https://openalex.org/W1974526404","https://openalex.org/W1994772769","https://openalex.org/W2007273639","https://openalex.org/W2024930473","https://openalex.org/W2063544484","https://openalex.org/W2064671795","https://openalex.org/W2088101210","https://openalex.org/W2093813380","https://openalex.org/W2133296809","https://openalex.org/W2152564789","https://openalex.org/W2169036209","https://openalex.org/W2397770138","https://openalex.org/W2490165199","https://openalex.org/W2560613285","https://openalex.org/W2566930933","https://openalex.org/W2608702473","https://openalex.org/W2779456973","https://openalex.org/W2805701404","https://openalex.org/W2963710502","https://openalex.org/W3147249397","https://openalex.org/W4255005259","https://openalex.org/W4389615669"],"related_works":["https://openalex.org/W4206434459","https://openalex.org/W3111157199","https://openalex.org/W3118503757","https://openalex.org/W2760717005","https://openalex.org/W2090890022","https://openalex.org/W2163118894","https://openalex.org/W58346954","https://openalex.org/W2359638073","https://openalex.org/W3009759344","https://openalex.org/W1545076181"],"abstract_inverted_index":{"Approximate":[0],"Nearest":[1],"Neighbor":[2],"(ANN)":[3],"search":[4],"is":[5,174,184,193,206],"a":[6,53,109],"fundamental":[7],"computational":[8],"problem":[9],"that":[10],"has":[11,25],"benefited":[12],"from":[13,58],"significant":[14],"progress":[15],"in":[16,47,52,66,213],"the":[17,144,159,188,191,203],"past":[18],"couple":[19],"of":[20,56,73,98,111,161,190,215],"decades.":[21],"However,":[22],"most":[23],"work":[24],"been":[26,35],"devoted":[27],"to":[28,64,104,135],"pointsets,":[29],"whereas":[30],"complex":[31],"shapes":[32],"have":[33],"not":[34],"sufficiently":[36],"addressed.":[37],"Here,":[38],"we":[39,81,196],"focus":[40,197],"on":[41,91,198],"distance":[42,112,125,201],"functions":[43],"between":[44,113],"discretized":[45,114],"curves":[46,192],"Euclidean":[48,74],"space:":[49],"They":[50],"appear":[51],"wide":[54],"range":[55],"applications,":[57],"road":[59],"segments":[60],"and":[61,84,121,132,148,165,209],"molecular":[62],"backbones":[63],"time-series":[65],"general":[67],"dimension.":[68],"For":[69],"\u2113":[70],"p":[71,79],"-products":[72],"metrics,":[75],"for":[76,88,141,151],"any":[77],"constant":[78],",":[80],"propose":[82],"simple":[83],"efficient":[85,186],"data":[86,95,146],"structures":[87,96,147],"ANN":[89,152],"based":[90],"randomized":[92],"projections:":[93],"These":[94,127],"are":[97,128],"independent":[99],"interest.":[100],"Furthermore,":[101],"they":[102],"serve":[103],"solve":[105],"proximity":[106],"questions":[107],"under":[108],"notion":[110],"curves,":[115],"which":[116],"generalizes":[117],"both":[118,142],"discrete":[119,199],"Fr\u00e9chet":[120,200],"Dynamic":[122],"Time":[123],"Warping":[124],"functions.":[126],"two":[129],"very":[130],"popular":[131],"practical":[133],"approaches":[134],"comparing":[136],"such":[137],"curves.":[138],"We":[139],"offer,":[140],"approaches,":[143],"first":[145],"query":[149],"algorithms":[150],"with":[153],"arbitrarily":[154],"good":[155],"approximation":[156],"factor,":[157],"at":[158],"expense":[160],"increasing":[162],"space":[163,205],"usage":[164],"preprocessing":[166],"time":[167,172],"over":[168],"existing":[169],"methods.":[170],"Query":[171],"complexity":[173,211],"comparable":[175],"or":[176],"significantly":[177],"improved":[178,222],"by":[179],"our":[180,182],"methods;":[181],"algorithm":[183],"especially":[185],"when":[187,202],"length":[189],"bounded.":[194],"Finally,":[195],"ambient":[204],"high":[207],"dimensional":[208],"derive":[210],"bounds":[212],"terms":[214],"doubling":[216],"dimension":[217],"as":[218,220],"well":[219],"an":[221],"approximate":[223],"near":[224],"neighbor":[225],"search.":[226]},"counts_by_year":[{"year":2022,"cited_by_count":3}],"updated_date":"2026-06-17T08:01:34.144755","created_date":"2025-10-10T00:00:00"}
