{"id":"https://openalex.org/W7162530501","doi":"https://doi.org/10.4230/lipics.socg.2026.69","title":"Approximate Dynamic Nearest Neighbor Searching in a Polygonal Domain","display_name":"Approximate Dynamic Nearest Neighbor Searching in a Polygonal Domain","publication_year":2026,"publication_date":"2026-01-01","ids":{"openalex":"https://openalex.org/W7162530501","doi":"https://doi.org/10.4230/lipics.socg.2026.69"},"language":"en","primary_location":{"id":"pmh:oai:drops-oai.dagstuhl.de:25876","is_oa":true,"landing_page_url":"https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SoCG.2026.69","pdf_url":"https://drops.dagstuhl.de/storage/00lipics/lipics-vol367-socg2026/LIPIcs.SoCG.2026.69/LIPIcs.SoCG.2026.69.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.69/LIPIcs.SoCG.2026.69.pdf","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5129245653","display_name":"Joost van der Laan","orcid":null},"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 der Laan, Joost","raw_affiliation_strings":["Department of Information and Computing Sciences, Utrecht University, The Netherlands"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Information and Computing Sciences, Utrecht University, The Netherlands","institution_ids":["https://openalex.org/I193662353"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5137139664","display_name":"Frank Staals","orcid":"https://orcid.org/0009-0004-8522-1351"},"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":"Staals, Frank","raw_affiliation_strings":["Department of Information and Computing Sciences, Utrecht University, The Netherlands"],"raw_orcid":"https://orcid.org/0009-0004-8522-1351","affiliations":[{"raw_affiliation_string":"Department of Information and Computing Sciences, Utrecht University, The Netherlands","institution_ids":["https://openalex.org/I193662353"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5129093329","display_name":"Lorenzo Theunissen","orcid":null},"institutions":[{"id":"https://openalex.org/I98358874","display_name":"Delft University of Technology","ror":"https://ror.org/02e2c7k09","country_code":"NL","type":"education","lineage":["https://openalex.org/I98358874"]}],"countries":["NL"],"is_corresponding":false,"raw_author_name":"Theunissen, Lorenzo","raw_affiliation_strings":["Delft University of Technology, The Netherlands"],"raw_orcid":"https://orcid.org/0009-0008-3405-541X","affiliations":[{"raw_affiliation_string":"Delft University of Technology, The Netherlands","institution_ids":["https://openalex.org/I98358874"]}]}],"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.63126253,"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.6974999904632568,"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.6974999904632568,"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.16850000619888306,"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/T12536","display_name":"Topological and Geometric Data Analysis","score":0.01720000058412552,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"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/k-nearest-neighbors-algorithm","display_name":"k-nearest neighbors algorithm","score":0.6266000270843506},{"id":"https://openalex.org/keywords/domain","display_name":"Domain (mathematical analysis)","score":0.5896000266075134},{"id":"https://openalex.org/keywords/data-structure","display_name":"Data structure","score":0.5489000082015991},{"id":"https://openalex.org/keywords/point","display_name":"Point (geometry)","score":0.5464000105857849},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.534600019454956},{"id":"https://openalex.org/keywords/path","display_name":"Path (computing)","score":0.5275999903678894},{"id":"https://openalex.org/keywords/space","display_name":"Space (punctuation)","score":0.4871000051498413},{"id":"https://openalex.org/keywords/binary-logarithm","display_name":"Binary logarithm","score":0.4745999872684479},{"id":"https://openalex.org/keywords/nearest-neighbor-search","display_name":"Nearest neighbor search","score":0.46639999747276306}],"concepts":[{"id":"https://openalex.org/C113238511","wikidata":"https://www.wikidata.org/wiki/Q1071612","display_name":"k-nearest neighbors algorithm","level":2,"score":0.6266000270843506},{"id":"https://openalex.org/C36503486","wikidata":"https://www.wikidata.org/wiki/Q11235244","display_name":"Domain (mathematical analysis)","level":2,"score":0.5896000266075134},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.5770000219345093},{"id":"https://openalex.org/C162319229","wikidata":"https://www.wikidata.org/wiki/Q175263","display_name":"Data structure","level":2,"score":0.5489000082015991},{"id":"https://openalex.org/C28719098","wikidata":"https://www.wikidata.org/wiki/Q44946","display_name":"Point (geometry)","level":2,"score":0.5464000105857849},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5408999919891357},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.534600019454956},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.5275999903678894},{"id":"https://openalex.org/C2778572836","wikidata":"https://www.wikidata.org/wiki/Q380933","display_name":"Space (punctuation)","level":2,"score":0.4871000051498413},{"id":"https://openalex.org/C63553672","wikidata":"https://www.wikidata.org/wiki/Q581168","display_name":"Binary logarithm","level":2,"score":0.4745999872684479},{"id":"https://openalex.org/C116738811","wikidata":"https://www.wikidata.org/wiki/Q608751","display_name":"Nearest neighbor search","level":2,"score":0.46639999747276306},{"id":"https://openalex.org/C46264003","wikidata":"https://www.wikidata.org/wiki/Q5456333","display_name":"Fixed-radius near neighbors","level":5,"score":0.451200008392334},{"id":"https://openalex.org/C29123130","wikidata":"https://www.wikidata.org/wiki/Q874709","display_name":"Computational geometry","level":2,"score":0.43230000138282776},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.42570000886917114},{"id":"https://openalex.org/C90988772","wikidata":"https://www.wikidata.org/wiki/Q2855103","display_name":"Nearest neighbor graph","level":3,"score":0.4009999930858612},{"id":"https://openalex.org/C22590252","wikidata":"https://www.wikidata.org/wiki/Q1058754","display_name":"Shortest path problem","level":3,"score":0.35929998755455017},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.3467999994754791},{"id":"https://openalex.org/C21080849","wikidata":"https://www.wikidata.org/wiki/Q13611879","display_name":"Data point","level":2,"score":0.34139999747276306},{"id":"https://openalex.org/C161986146","wikidata":"https://www.wikidata.org/wiki/Q4896845","display_name":"Best bin first","level":3,"score":0.32670000195503235},{"id":"https://openalex.org/C53661774","wikidata":"https://www.wikidata.org/wiki/Q13108095","display_name":"Cover tree","level":5,"score":0.3179999887943268},{"id":"https://openalex.org/C58489278","wikidata":"https://www.wikidata.org/wiki/Q1172284","display_name":"Data set","level":2,"score":0.3010999858379364},{"id":"https://openalex.org/C186750021","wikidata":"https://www.wikidata.org/wiki/Q7208210","display_name":"Point location","level":3,"score":0.30090001225471497},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.29760000109672546},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.2766000032424927},{"id":"https://openalex.org/C3018263672","wikidata":"https://www.wikidata.org/wiki/Q1296251","display_name":"Efficient algorithm","level":2,"score":0.26339998841285706},{"id":"https://openalex.org/C2778112365","wikidata":"https://www.wikidata.org/wiki/Q3511065","display_name":"Sequence (biology)","level":2,"score":0.26269999146461487},{"id":"https://openalex.org/C73586568","wikidata":"https://www.wikidata.org/wiki/Q2600211","display_name":"Parameter space","level":2,"score":0.2612000107765198},{"id":"https://openalex.org/C102164700","wikidata":"https://www.wikidata.org/wiki/Q17162702","display_name":"Nearest-neighbor chain algorithm","level":5,"score":0.2549999952316284}],"mesh":[],"locations_count":2,"locations":[{"id":"pmh:oai:drops-oai.dagstuhl.de:25876","is_oa":true,"landing_page_url":"https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SoCG.2026.69","pdf_url":"https://drops.dagstuhl.de/storage/00lipics/lipics-vol367-socg2026/LIPIcs.SoCG.2026.69/LIPIcs.SoCG.2026.69.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":"doi:10.4230/lipics.socg.2026.69","is_oa":true,"landing_page_url":"https://doi.org/10.4230/lipics.socg.2026.69","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:25876","is_oa":true,"landing_page_url":"https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SoCG.2026.69","pdf_url":"https://drops.dagstuhl.de/storage/00lipics/lipics-vol367-socg2026/LIPIcs.SoCG.2026.69/LIPIcs.SoCG.2026.69.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":[],"funders":[],"has_content":{"pdf":true,"grobid_xml":true},"content_urls":{"pdf":"https://content.openalex.org/works/W7162530501.pdf","grobid_xml":"https://content.openalex.org/works/W7162530501.grobid-xml"},"referenced_works_count":0,"referenced_works":[],"related_works":[],"abstract_inverted_index":{"We":[0,58],"present":[1],"efficient":[2],"data":[3,111,144,192],"structures":[4],"for":[5,95],"approximate":[6,11],"nearest":[7,177],"neighbor":[8,178],"searching":[9],"and":[10,63,123,164,174],"2-point":[12],"shortest":[13],"path":[14],"queries":[15],"in":[16,38,65,125,179,196],"a":[17,30,46,88,100,116,151],"two-dimensional":[18],"polygonal":[19],"domain":[20],"P":[21,39,86],"with":[22],"n":[23,138,181,184,198,201],"vertices.":[24],"Our":[25,191],"goal":[26],"is":[27,166],"to":[28,52,149],"store":[29],"dynamic":[31],"set":[32,67],"of":[33,68,82,91,118],"m":[34,186,203],"point":[35,56,162],"sites":[36,69],"S":[37,50,155],"so":[40,156],"that":[41,113,146,157],"we":[42,93,105,132],"can":[43,114],"efficiently":[44],"find":[45],"site":[47,152],"s":[48,124,153,165],"\u2208":[49,85,154],"closest":[51],"an":[53,79,107,135],"arbitrary":[54,80],"query":[55,161],"q.":[57],"will":[59],"allow":[60,94],"both":[61],"insertions":[62],"deletions":[64],"the":[66,76,97,119,158,170],"S.":[70],"However,":[71],"as":[72],"even":[73],"just":[74],"computing":[75],"distance":[77,120,159,171],"between":[78,121,160,172],"pair":[81],"points":[83],"q,s":[84],"requires":[87],"substantial":[89],"amount":[90],"space,":[92],"approximating":[96],"distances.":[98],"Given":[99],"parameter":[101],"\u03b5":[102],">":[103],"0,":[104],"build":[106],"O(n/(\u03b5)log":[108],"n)":[109,127],"space":[110,143],"structure":[112,145,193],"compute":[115],"1+\u03b5-approximation":[117],"q":[122,163,173],"O((1/\u03b5\u00b2)log":[126,180,197],"time.":[128,190,208],"Building":[129],"on":[130],"this,":[131],"then":[133],"obtain":[134],"O((n+m)/\u03b5":[136],"log":[137,141,185,202],"+":[139,182,187,199,204],"m/\u03b5":[140],"m)":[142,189,206],"allows":[147],"us":[148],"report":[150],"at":[167],"most":[168],"(1+\u03b5)-times":[169],"its":[175],"true":[176],"1/(\u03b5)log":[183],"(1/\u03b5)log\u00b2":[188,205],"supports":[194],"updates":[195],"(1/\u03b5)log":[200],"amortized":[207]},"counts_by_year":[],"updated_date":"2026-07-28T07:46:37.118299","created_date":"2026-05-28T00:00:00"}