{"id":"https://openalex.org/W4310626824","doi":"https://doi.org/10.4230/lipics.isaac.2021.14","title":"Dynamic Data Structures for k-Nearest Neighbor Queries","display_name":"Dynamic Data Structures for k-Nearest Neighbor Queries","publication_year":2021,"publication_date":"2021-01-01","ids":{"openalex":"https://openalex.org/W4310626824","doi":"https://doi.org/10.4230/lipics.isaac.2021.14"},"language":"en","primary_location":{"id":"pmh:uu:oai:dspace.library.uu.nl:1874/415083","is_oa":true,"landing_page_url":"https://dspace.library.uu.nl/handle/1874/415083","pdf_url":null,"source":{"id":"https://openalex.org/S4306401843","display_name":"Data Archiving and Networked Services (DANS)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I1322597698","host_organization_name":"Royal Netherlands Academy of Arts and Sciences","host_organization_lineage":["https://openalex.org/I1322597698"],"host_organization_lineage_names":[],"type":"repository"},"license":"other-oa","license_id":"https://openalex.org/licenses/other-oa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"32nd International Symposium on Algorithms and Computation, ISAAC 2021, December 6-8, 2021, Fukuoka, Japan, 212, 1. Schloss Dagstuhl \u2013 Leibniz-Zentrum f\u00fcr Informatik GmbH","raw_type":"info:eu-repo/semantics/bookpart"},"type":"preprint","indexed_in":[],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://dspace.library.uu.nl/handle/1874/415083","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5076201541","display_name":"Sarita de Berg","orcid":"https://orcid.org/0000-0001-5555-966X"},"institutions":[],"countries":[],"is_corresponding":true,"raw_author_name":"Berg, Sarita de","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5032979919","display_name":"Frank Staals","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Staals, Frank","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"middle","author":{"id":null,"display_name":"Ahn, Hee-Kap","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Ahn, Hee-Kap","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"middle","author":{"id":null,"display_name":"Sadakane, Kunihiko","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Sadakane, Kunihiko","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"middle","author":{"id":null,"display_name":"Sub Geometric Computing","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Sub Geometric Computing","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"last","author":{"id":null,"display_name":"Geometric Computing","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Geometric Computing","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":6,"corresponding_author_ids":["https://openalex.org/A5076201541"],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":{"value":0.64924347,"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.9970999956130981,"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.9970999956130981,"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.9939000010490417,"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/T11269","display_name":"Algorithms and Data Compression","score":0.9678000211715698,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/geodesic","display_name":"Geodesic","score":0.606987714767456},{"id":"https://openalex.org/keywords/data-structure","display_name":"Data structure","score":0.5952579975128174},{"id":"https://openalex.org/keywords/logarithm","display_name":"Logarithm","score":0.5526559352874756},{"id":"https://openalex.org/keywords/euclidean-geometry","display_name":"Euclidean geometry","score":0.5014564990997314},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.4870927333831787},{"id":"https://openalex.org/keywords/k-nearest-neighbors-algorithm","display_name":"k-nearest neighbors algorithm","score":0.48346787691116333},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.4819362163543701},{"id":"https://openalex.org/keywords/euclidean-distance","display_name":"Euclidean distance","score":0.46771401166915894},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.46571993827819824},{"id":"https://openalex.org/keywords/plane","display_name":"Plane (geometry)","score":0.4559595584869385},{"id":"https://openalex.org/keywords/algebraic-number","display_name":"Algebraic number","score":0.4136080741882324},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.4084901213645935},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.38164621591567993},{"id":"https://openalex.org/keywords/geometry","display_name":"Geometry","score":0.10393133759498596}],"concepts":[{"id":"https://openalex.org/C165818556","wikidata":"https://www.wikidata.org/wiki/Q213488","display_name":"Geodesic","level":2,"score":0.606987714767456},{"id":"https://openalex.org/C162319229","wikidata":"https://www.wikidata.org/wiki/Q175263","display_name":"Data structure","level":2,"score":0.5952579975128174},{"id":"https://openalex.org/C39927690","wikidata":"https://www.wikidata.org/wiki/Q11197","display_name":"Logarithm","level":2,"score":0.5526559352874756},{"id":"https://openalex.org/C129782007","wikidata":"https://www.wikidata.org/wiki/Q162886","display_name":"Euclidean geometry","level":2,"score":0.5014564990997314},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.4870927333831787},{"id":"https://openalex.org/C113238511","wikidata":"https://www.wikidata.org/wiki/Q1071612","display_name":"k-nearest neighbors algorithm","level":2,"score":0.48346787691116333},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.4819362163543701},{"id":"https://openalex.org/C120174047","wikidata":"https://www.wikidata.org/wiki/Q847073","display_name":"Euclidean distance","level":2,"score":0.46771401166915894},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.46571993827819824},{"id":"https://openalex.org/C17825722","wikidata":"https://www.wikidata.org/wiki/Q17285","display_name":"Plane (geometry)","level":2,"score":0.4559595584869385},{"id":"https://openalex.org/C9376300","wikidata":"https://www.wikidata.org/wiki/Q168817","display_name":"Algebraic number","level":2,"score":0.4136080741882324},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.4084901213645935},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.38164621591567993},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.10393133759498596},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.0},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"pmh:uu:oai:dspace.library.uu.nl:1874/415083","is_oa":true,"landing_page_url":"https://dspace.library.uu.nl/handle/1874/415083","pdf_url":null,"source":{"id":"https://openalex.org/S4306401843","display_name":"Data Archiving and Networked Services (DANS)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I1322597698","host_organization_name":"Royal Netherlands Academy of Arts and Sciences","host_organization_lineage":["https://openalex.org/I1322597698"],"host_organization_lineage_names":[],"type":"repository"},"license":"other-oa","license_id":"https://openalex.org/licenses/other-oa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"32nd International Symposium on Algorithms and Computation, ISAAC 2021, December 6-8, 2021, Fukuoka, Japan, 212, 1. Schloss Dagstuhl \u2013 Leibniz-Zentrum f\u00fcr Informatik GmbH","raw_type":"info:eu-repo/semantics/bookpart"}],"best_oa_location":{"id":"pmh:uu:oai:dspace.library.uu.nl:1874/415083","is_oa":true,"landing_page_url":"https://dspace.library.uu.nl/handle/1874/415083","pdf_url":null,"source":{"id":"https://openalex.org/S4306401843","display_name":"Data Archiving and Networked Services (DANS)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I1322597698","host_organization_name":"Royal Netherlands Academy of Arts and Sciences","host_organization_lineage":["https://openalex.org/I1322597698"],"host_organization_lineage_names":[],"type":"repository"},"license":"other-oa","license_id":"https://openalex.org/licenses/other-oa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"32nd International Symposium on Algorithms and Computation, ISAAC 2021, December 6-8, 2021, Fukuoka, Japan, 212, 1. Schloss Dagstuhl \u2013 Leibniz-Zentrum f\u00fcr Informatik GmbH","raw_type":"info:eu-repo/semantics/bookpart"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":0,"referenced_works":[],"related_works":["https://openalex.org/W2990663423","https://openalex.org/W2090152127","https://openalex.org/W2169691698","https://openalex.org/W3171568022","https://openalex.org/W1965169884","https://openalex.org/W3125580510","https://openalex.org/W2008939113","https://openalex.org/W14679004","https://openalex.org/W2097149198","https://openalex.org/W2023878529"],"abstract_inverted_index":{"Our":[0],"aim":[1],"is":[2,28,37],"to":[3,45,63,74,100,128],"develop":[4],"dynamic":[5,94,132,163],"data":[6,79,83,126,156,165],"structures":[7],"that":[8,42],"support":[9,130],"k-nearest":[10],"neighbors":[11],"(k-NN)":[12],"queries":[13,135],"for":[14,111,167,173,190],"a":[15,38,56,82,137,142,150,162],"set":[16,138],"of":[17,32,139,170,184],"n":[18,107],"point":[19],"sites":[20,140],"in":[21,59,141,187],"O(f(n)":[22],"+":[23],"k)":[24],"time,":[25],"where":[26],"f(n)":[27],"some":[29],"polylogarithmic":[30,120],"function":[31],"n.":[33],"The":[34],"key":[35],"component":[36],"general":[39],"query":[40,61,109],"algorithm":[41],"allows":[43,72,98],"us":[44,73,99],"find":[46],"the":[47,60,69,92,102,112,119,188,191,194],"k-NN":[48,78,134,155,164],"spread":[49],"over":[50],"t":[51],"substructures":[52],"simultaneously,":[53],"thus":[54],"reducing":[55],"O(tk)":[57],"term":[58],"time":[62,110],"O(k).":[64],"Combining":[65],"this":[66,96,125,146],"technique":[67,97],"with":[68],"logarithmic":[70],"method":[71],"turn":[75],"any":[76,168],"static":[77],"structure":[80,84,127,166],"into":[81],"supporting":[85],"both":[86],"efficient":[87],"insertions":[88],"and":[89,197],"queries.":[90],"For":[91,145],"fully":[93,131],"case,":[95],"recover":[101],"deterministic,":[103],"worst-case,":[104],"O(log\u00b2n/log":[105],"log":[106],"+k)":[108],"Euclidean":[113,192],"distance":[114,171,201],"claimed":[115],"before,":[116],"while":[117],"preserving":[118],"update":[121],"times.":[122],"We":[123,181],"adapt":[124],"also":[129],"geodesic":[133,195],"among":[136],"simple":[143],"polygon.":[144],"purpose,":[147],"we":[148,160,175],"design":[149],"shallow":[151,179],"cutting":[152],"based,":[153],"deletion-only":[154],"structure.":[157],"More":[158],"generally,":[159],"obtain":[161],"type":[169],"functions":[172],"which":[174],"can":[176],"build":[177],"vertical":[178],"cuttings.":[180],"apply":[182],"all":[183],"our":[185],"methods":[186],"plane":[189],"distance,":[193,196],"general,":[198],"constant-complexity,":[199],"algebraic":[200],"functions.":[202]},"counts_by_year":[],"updated_date":"2026-04-28T14:05:53.105641","created_date":"2022-12-13T00:00:00"}