{"id":"https://openalex.org/W2981835202","doi":"https://doi.org/10.1137/20m1388371","title":"Nearly Optimal Planar $k$ Nearest Neighbors Queries under General Distance Functions","display_name":"Nearly Optimal Planar $k$ Nearest Neighbors Queries under General Distance Functions","publication_year":2022,"publication_date":"2022-05-26","ids":{"openalex":"https://openalex.org/W2981835202","doi":"https://doi.org/10.1137/20m1388371","mag":"2981835202"},"language":"en","primary_location":{"id":"doi:10.1137/20m1388371","is_oa":false,"landing_page_url":"https://doi.org/10.1137/20m1388371","pdf_url":null,"source":{"id":"https://openalex.org/S153560523","display_name":"SIAM Journal on Computing","issn_l":"0097-5397","issn":["0097-5397","1095-7111"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320508","host_organization_name":"Society for Industrial and Applied Mathematics","host_organization_lineage":["https://openalex.org/P4310320508"],"host_organization_lineage_names":["Society for Industrial and Applied Mathematics"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"SIAM Journal on Computing","raw_type":"journal-article"},"type":"article","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/A5008771140","display_name":"Chih-Hung Liu","orcid":"https://orcid.org/0000-0001-9683-5982"},"institutions":[],"countries":[],"is_corresponding":true,"raw_author_name":"Chih-Hung Liu","raw_affiliation_strings":[],"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5008771140"],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":2.3749,"has_fulltext":false,"cited_by_count":10,"citation_normalized_percentile":{"value":0.91781361,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":90,"max":97},"biblio":{"volume":"51","issue":"3","first_page":"723","last_page":"765"},"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.9998999834060669,"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.9998999834060669,"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.9950000047683716,"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/T11164","display_name":"Remote Sensing and LiDAR Applications","score":0.9944999814033508,"subfield":{"id":"https://openalex.org/subfields/2305","display_name":"Environmental Engineering"},"field":{"id":"https://openalex.org/fields/23","display_name":"Environmental Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.7378207445144653},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.721062958240509},{"id":"https://openalex.org/keywords/metric-space","display_name":"Metric space","score":0.5832972526550293},{"id":"https://openalex.org/keywords/binary-logarithm","display_name":"Binary logarithm","score":0.5526797771453857},{"id":"https://openalex.org/keywords/metric","display_name":"Metric (unit)","score":0.5105472803115845},{"id":"https://openalex.org/keywords/disjoint-sets","display_name":"Disjoint sets","score":0.5011298656463623},{"id":"https://openalex.org/keywords/euclidean-distance","display_name":"Euclidean distance","score":0.49472948908805847},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.4783869981765747},{"id":"https://openalex.org/keywords/intersection","display_name":"Intersection (aeronautics)","score":0.44958072900772095},{"id":"https://openalex.org/keywords/nearest-neighbor-search","display_name":"Nearest neighbor search","score":0.4454009234905243},{"id":"https://openalex.org/keywords/linear-space","display_name":"Linear space","score":0.42876797914505005},{"id":"https://openalex.org/keywords/euclidean-space","display_name":"Euclidean space","score":0.42175206542015076},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.3916054368019104},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.15649738907814026},{"id":"https://openalex.org/keywords/geometry","display_name":"Geometry","score":0.09792521595954895}],"concepts":[{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.7378207445144653},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.721062958240509},{"id":"https://openalex.org/C198043062","wikidata":"https://www.wikidata.org/wiki/Q180953","display_name":"Metric space","level":2,"score":0.5832972526550293},{"id":"https://openalex.org/C63553672","wikidata":"https://www.wikidata.org/wiki/Q581168","display_name":"Binary logarithm","level":2,"score":0.5526797771453857},{"id":"https://openalex.org/C176217482","wikidata":"https://www.wikidata.org/wiki/Q860554","display_name":"Metric (unit)","level":2,"score":0.5105472803115845},{"id":"https://openalex.org/C45340560","wikidata":"https://www.wikidata.org/wiki/Q215382","display_name":"Disjoint sets","level":2,"score":0.5011298656463623},{"id":"https://openalex.org/C120174047","wikidata":"https://www.wikidata.org/wiki/Q847073","display_name":"Euclidean distance","level":2,"score":0.49472948908805847},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.4783869981765747},{"id":"https://openalex.org/C64543145","wikidata":"https://www.wikidata.org/wiki/Q162942","display_name":"Intersection (aeronautics)","level":2,"score":0.44958072900772095},{"id":"https://openalex.org/C116738811","wikidata":"https://www.wikidata.org/wiki/Q608751","display_name":"Nearest neighbor search","level":2,"score":0.4454009234905243},{"id":"https://openalex.org/C176370821","wikidata":"https://www.wikidata.org/wiki/Q1826459","display_name":"Linear space","level":2,"score":0.42876797914505005},{"id":"https://openalex.org/C186450821","wikidata":"https://www.wikidata.org/wiki/Q17295","display_name":"Euclidean space","level":2,"score":0.42175206542015076},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.3916054368019104},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.15649738907814026},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.09792521595954895},{"id":"https://openalex.org/C162324750","wikidata":"https://www.wikidata.org/wiki/Q8134","display_name":"Economics","level":0,"score":0.0},{"id":"https://openalex.org/C146978453","wikidata":"https://www.wikidata.org/wiki/Q3798668","display_name":"Aerospace engineering","level":1,"score":0.0},{"id":"https://openalex.org/C127413603","wikidata":"https://www.wikidata.org/wiki/Q11023","display_name":"Engineering","level":0,"score":0.0},{"id":"https://openalex.org/C21547014","wikidata":"https://www.wikidata.org/wiki/Q1423657","display_name":"Operations management","level":1,"score":0.0},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1137/20m1388371","is_oa":false,"landing_page_url":"https://doi.org/10.1137/20m1388371","pdf_url":null,"source":{"id":"https://openalex.org/S153560523","display_name":"SIAM Journal on Computing","issn_l":"0097-5397","issn":["0097-5397","1095-7111"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320508","host_organization_name":"Society for Industrial and Applied Mathematics","host_organization_lineage":["https://openalex.org/P4310320508"],"host_organization_lineage_names":["Society for Industrial and Applied Mathematics"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"SIAM Journal on Computing","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[{"display_name":"Industry, innovation and infrastructure","score":0.6499999761581421,"id":"https://metadata.un.org/sdg/9"}],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":51,"referenced_works":["https://openalex.org/W180118279","https://openalex.org/W279200107","https://openalex.org/W1547671143","https://openalex.org/W1593563200","https://openalex.org/W1595208863","https://openalex.org/W1847031659","https://openalex.org/W1956345397","https://openalex.org/W1965146563","https://openalex.org/W1966950432","https://openalex.org/W2007610503","https://openalex.org/W2026763406","https://openalex.org/W2027277859","https://openalex.org/W2028747718","https://openalex.org/W2039849774","https://openalex.org/W2048729985","https://openalex.org/W2049628988","https://openalex.org/W2050459520","https://openalex.org/W2058432138","https://openalex.org/W2058889860","https://openalex.org/W2060978628","https://openalex.org/W2067631433","https://openalex.org/W2079093471","https://openalex.org/W2094683955","https://openalex.org/W2100503751","https://openalex.org/W2101894996","https://openalex.org/W2103893986","https://openalex.org/W2106413026","https://openalex.org/W2109067131","https://openalex.org/W2116060765","https://openalex.org/W2127366419","https://openalex.org/W2128227281","https://openalex.org/W2132026455","https://openalex.org/W2160775966","https://openalex.org/W2167816765","https://openalex.org/W2282988760","https://openalex.org/W2341957977","https://openalex.org/W2508929803","https://openalex.org/W2568603896","https://openalex.org/W2624483937","https://openalex.org/W2905387757","https://openalex.org/W2962776480","https://openalex.org/W2962864099","https://openalex.org/W2963182982","https://openalex.org/W2963554243","https://openalex.org/W3004252175","https://openalex.org/W3102176745","https://openalex.org/W3137365097","https://openalex.org/W4210881201","https://openalex.org/W4241504821","https://openalex.org/W4251391716","https://openalex.org/W4254977685"],"related_works":["https://openalex.org/W2113119382","https://openalex.org/W2097149198","https://openalex.org/W3171568022","https://openalex.org/W1882921205","https://openalex.org/W3037318061","https://openalex.org/W3012121065","https://openalex.org/W4287826554","https://openalex.org/W2105228010","https://openalex.org/W2749646986","https://openalex.org/W2243241072"],"abstract_inverted_index":{"We":[0,43,71],"study":[1],"the":[2,8,35,105,114,147,157,165,193,202,230],"$k$":[3,148,194],"nearest":[4,149,195],"neighbors":[5,150,196],"problem":[6,197],"in":[7,113,127,135,164,201],"plane":[9],"for":[10,49,110,146,180,198,229],"general,":[11],"convex,":[12],"pairwise":[13],"disjoint":[14],"sites":[15,112,163,200],"of":[16,31,83,177,218,232,251],"constant":[17],"description":[18],"complexity":[19],"such":[20,121],"as":[21,122],"line":[22],"segments,":[23],"disks,":[24],"and":[25,38,64,81,93,100,117,132,235],"quadrilaterals":[26],"under":[27],"a":[28,45,74,128,188,224,240],"general":[29,51,129,152,181,209],"family":[30],"distance":[32,153,182,210],"functions":[33,154,211],"including":[34],"$L_p$":[36],"norms":[37],"additively":[39],"weighted":[40],"Euclidean":[41,115,166,203],"distances.":[42],"compose":[44],"static":[46],"data":[47,76],"structure":[48,77],"this":[50,170,237],"setting":[52],"with":[53,85,161],"nearly":[54],"optimal":[55,59,65],"$O(n\\log\\log":[56],"n)$":[57,68,87,90,97],"space,":[58,88],"$O(\\log":[60],"n+k)$":[61],"query":[62,91],"time,":[63,92,103],"expected":[66,94],"$O(n\\log":[67,86],"preprocessing":[69],"time.":[70],"also":[72],"devise":[73],"dynamic":[75,123,133],"(that":[78],"allows":[79],"insertions":[80],"deletions":[82],"sites)":[84],"$O(\\log^2n+k\\log":[89],"amortized":[95],"$O(\\log^2":[96],"insertion":[98],"time":[99,108,159],"$O(\\log^4n)$":[101],"deletion":[102],"matching":[104],"best":[106],"known":[107],"complexities":[109,160],"point":[111,162,199],"metric":[116,131],"improving":[118],"many":[119],"applications":[120],"minimum":[124],"spanning":[125],"trees":[126],"planar":[130],"connectivity":[134],"disk":[136],"intersection":[137],"graphs.":[138],"Our":[139,221],"results,":[140],"to":[141,191,208,243],"some":[142],"extent,":[143],"indicate":[144],"that":[145],"problem,":[151],"may":[155],"share":[156],"same":[158],"metric.":[167],"To":[168],"achieve":[169],"progress,":[171],"we":[172,247],"design":[173],"vertical":[174,215],"shallow":[175,185],"cuttings":[176,186],"linear":[178,219],"size":[179],"functions.":[183],"Vertical":[184],"are":[187,212],"key":[189],"technique":[190,228,238],"tackle":[192],"metric,":[204],"while":[205],"existing":[206],"generalizations":[207],"either":[213],"not":[214,217],"or":[216],"size.":[220],"innovation":[222],"is":[223,250],"new":[225,241],"random":[226],"sampling":[227],"analysis":[231],"geometric":[233,245],"structures,":[234],"since":[236],"provides":[239],"way":[242],"develop":[244],"algorithms,":[246],"believe":[248],"it":[249],"independent":[252],"interest.":[253]},"counts_by_year":[{"year":2025,"cited_by_count":1},{"year":2024,"cited_by_count":1},{"year":2023,"cited_by_count":3},{"year":2022,"cited_by_count":2},{"year":2021,"cited_by_count":2},{"year":2019,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}