{"id":"https://openalex.org/W2013729760","doi":"https://doi.org/10.1137/s0097539793259458","title":"New Techniques for Exact and Approximate Dynamic Closest-Point Problems","display_name":"New Techniques for Exact and Approximate Dynamic Closest-Point Problems","publication_year":1996,"publication_date":"1996-08-01","ids":{"openalex":"https://openalex.org/W2013729760","doi":"https://doi.org/10.1137/s0097539793259458","mag":"2013729760"},"language":"en","primary_location":{"id":"doi:10.1137/s0097539793259458","is_oa":false,"landing_page_url":"https://doi.org/10.1137/s0097539793259458","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/A5062694837","display_name":"Sanjiv Kapoor","orcid":"https://orcid.org/0000-0001-5637-9919"},"institutions":[{"id":"https://openalex.org/I149899117","display_name":"Max Planck Society","ror":"https://ror.org/01hhn8329","country_code":"DE","type":"funder","lineage":["https://openalex.org/I149899117"]}],"countries":["DE"],"is_corresponding":true,"raw_author_name":"Sanjiv Kapoor","raw_affiliation_strings":["Algorithms and Complexity, MPI for Informatics, Max Planck Society"],"affiliations":[{"raw_affiliation_string":"Algorithms and Complexity, MPI for Informatics, Max Planck Society","institution_ids":["https://openalex.org/I149899117"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5108374265","display_name":"Michiel Smid","orcid":null},"institutions":[{"id":"https://openalex.org/I149899117","display_name":"Max Planck Society","ror":"https://ror.org/01hhn8329","country_code":"DE","type":"funder","lineage":["https://openalex.org/I149899117"]}],"countries":["DE"],"is_corresponding":false,"raw_author_name":"Michiel Smid","raw_affiliation_strings":["Algorithms and Complexity, MPI for Informatics, Max Planck Society"],"affiliations":[{"raw_affiliation_string":"Algorithms and Complexity, MPI for Informatics, Max Planck Society","institution_ids":["https://openalex.org/I149899117"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5062694837"],"corresponding_institution_ids":["https://openalex.org/I149899117"],"apc_list":null,"apc_paid":null,"fwci":1.1277,"has_fulltext":false,"cited_by_count":11,"citation_normalized_percentile":{"value":0.78940887,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":94},"biblio":{"volume":"25","issue":"4","first_page":"775","last_page":"796"},"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/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9912999868392944,"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"}},{"id":"https://openalex.org/T12176","display_name":"Optimization and Packing Problems","score":0.9866999983787537,"subfield":{"id":"https://openalex.org/subfields/2209","display_name":"Industrial and Manufacturing Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.8174644708633423},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.6982884407043457},{"id":"https://openalex.org/keywords/amortized-analysis","display_name":"Amortized analysis","score":0.6656858921051025},{"id":"https://openalex.org/keywords/binary-logarithm","display_name":"Binary logarithm","score":0.6164923906326294},{"id":"https://openalex.org/keywords/integer","display_name":"Integer (computer science)","score":0.5728985071182251},{"id":"https://openalex.org/keywords/constant","display_name":"Constant (computer programming)","score":0.5044170618057251},{"id":"https://openalex.org/keywords/log-log-plot","display_name":"Log-log plot","score":0.48849761486053467},{"id":"https://openalex.org/keywords/euclidean-space","display_name":"Euclidean space","score":0.4629771113395691},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.45737338066101074},{"id":"https://openalex.org/keywords/k-nearest-neighbors-algorithm","display_name":"k-nearest neighbors algorithm","score":0.45709365606307983},{"id":"https://openalex.org/keywords/data-structure","display_name":"Data structure","score":0.4570063352584839},{"id":"https://openalex.org/keywords/computational-geometry","display_name":"Computational geometry","score":0.412202924489975},{"id":"https://openalex.org/keywords/space","display_name":"Space (punctuation)","score":0.41079622507095337},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.3506956100463867},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.17907476425170898},{"id":"https://openalex.org/keywords/mathematical-analysis","display_name":"Mathematical analysis","score":0.08145269751548767}],"concepts":[{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.8174644708633423},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.6982884407043457},{"id":"https://openalex.org/C142417499","wikidata":"https://www.wikidata.org/wiki/Q331716","display_name":"Amortized analysis","level":3,"score":0.6656858921051025},{"id":"https://openalex.org/C63553672","wikidata":"https://www.wikidata.org/wiki/Q581168","display_name":"Binary logarithm","level":2,"score":0.6164923906326294},{"id":"https://openalex.org/C97137487","wikidata":"https://www.wikidata.org/wiki/Q729138","display_name":"Integer (computer science)","level":2,"score":0.5728985071182251},{"id":"https://openalex.org/C2777027219","wikidata":"https://www.wikidata.org/wiki/Q1284190","display_name":"Constant (computer programming)","level":2,"score":0.5044170618057251},{"id":"https://openalex.org/C195292467","wikidata":"https://www.wikidata.org/wiki/Q2091879","display_name":"Log-log plot","level":3,"score":0.48849761486053467},{"id":"https://openalex.org/C186450821","wikidata":"https://www.wikidata.org/wiki/Q17295","display_name":"Euclidean space","level":2,"score":0.4629771113395691},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.45737338066101074},{"id":"https://openalex.org/C113238511","wikidata":"https://www.wikidata.org/wiki/Q1071612","display_name":"k-nearest neighbors algorithm","level":2,"score":0.45709365606307983},{"id":"https://openalex.org/C162319229","wikidata":"https://www.wikidata.org/wiki/Q175263","display_name":"Data structure","level":2,"score":0.4570063352584839},{"id":"https://openalex.org/C29123130","wikidata":"https://www.wikidata.org/wiki/Q874709","display_name":"Computational geometry","level":2,"score":0.412202924489975},{"id":"https://openalex.org/C2778572836","wikidata":"https://www.wikidata.org/wiki/Q380933","display_name":"Space (punctuation)","level":2,"score":0.41079622507095337},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.3506956100463867},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.17907476425170898},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.08145269751548767},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.0},{"id":"https://openalex.org/C41895202","wikidata":"https://www.wikidata.org/wiki/Q8162","display_name":"Linguistics","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},{"id":"https://openalex.org/C138885662","wikidata":"https://www.wikidata.org/wiki/Q5891","display_name":"Philosophy","level":0,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1137/s0097539793259458","is_oa":false,"landing_page_url":"https://doi.org/10.1137/s0097539793259458","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":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":17,"referenced_works":["https://openalex.org/W1979630448","https://openalex.org/W1993216012","https://openalex.org/W1998512964","https://openalex.org/W2003754801","https://openalex.org/W2006639374","https://openalex.org/W2007610503","https://openalex.org/W2029814178","https://openalex.org/W2031671531","https://openalex.org/W2048422125","https://openalex.org/W2051390146","https://openalex.org/W2060978628","https://openalex.org/W2061750047","https://openalex.org/W2061845601","https://openalex.org/W2129335013","https://openalex.org/W2134165468","https://openalex.org/W2911302472","https://openalex.org/W2999274412"],"related_works":["https://openalex.org/W1983377344","https://openalex.org/W2964260809","https://openalex.org/W2006811735","https://openalex.org/W4300573564","https://openalex.org/W2950408827","https://openalex.org/W2034114460","https://openalex.org/W1976803949","https://openalex.org/W2522910400","https://openalex.org/W4230281099","https://openalex.org/W2902751186"],"abstract_inverted_index":{"Let":[0],"S":[1,28],"be":[2,19],"a":[3,15,85,103,166,175],"set":[4],"of":[5,29,57,169,177,203,223,242],"n":[6],"points":[7],"in":[8,27,33,196],"$\\mathbb{R}^D":[9],"$.":[10,211],"It":[11],"is":[12,67,108,119,138,180,202],"shown":[13],"that":[14,88,111,164,236],"range":[16],"tree":[17],"can":[18],"used":[20,68],"to":[21,69,84,149],"find":[22],"an":[23,53,238],"$L_\\infty":[24],"$-nearest":[25],"neighbor":[26],"any":[30,99,217],"query":[31,100,154],"point":[32,101,104],"$O((\\log":[34,58,186],"n)^{D":[35,48,59,187],"-":[36,49,60,188],"1}":[37,50,61,189],"\\log":[38,39,62,63,190,191,229,245,253],"n)$":[40,246],"time.":[41],"This":[42,65,137],"data":[43,142,160,261],"structure":[44,143,176,262],"has":[45],"size":[46,151,178,224,260],"$O(n(\\log":[47],")$":[51,125,231],"and":[52,93,117,132,152,155,216],"amortized":[54,183,239],"update":[55,156,184,240,265],"time":[56,185,200,241,266],"n)$.":[64,192],"result":[66],"solve":[70],"the":[71,80,112,127,139,204],"$(1":[72,122],"+":[73,123],"\\epsilon":[74,124],")$-approximate":[75],"$L_2":[76],"$-nearest-neighbor":[77],"problem":[78,146],"within":[79],"same":[81],"bounds":[82],"(up":[83],"constant":[86,194,220],"factor":[87,195],"depends":[89],"on":[90],"$\\epsilon":[91],"$":[92,207],"D).":[94],"In":[95],"this":[96,145,197,270],"problem,":[97],"for":[98,144,269],"p,":[102],"$q":[105],"\\in":[106],"S$":[107],"computed":[109],"such":[110],"euclidean":[113,128],"distance":[114,129],"between":[115,130],"p":[116,131],"q":[118],"at":[120],"most":[121],"times":[126],"its":[133],"true":[134],"nearest":[135],"neighbor.":[136],"first":[140],"dynamic":[141,159],"having":[147,263],"close":[148],"linear":[150,259],"polylogarithmic":[153,264],"times.":[157],"New":[158],"structures":[161,222],"are":[162,234],"given":[163],"maintain":[165],"closest":[167],"pair":[168],"S.":[170],"For":[171,212],"$D":[172,213],"\\geqslant":[173],"3$,":[174],"$O(n)$":[179],"presented":[181,235],"with":[182],"The":[193],"space":[198],"(resp.":[199,232,247],"bound)":[201],"form":[205],"$O(D)^D":[206],"(res.":[208],"$2^{O(D^2":[209],")}":[210],"=":[214],"2$":[215],"nonnegative":[218],"integer":[219],"k,":[221],"$O({{n\\log":[225],"n}":[226],"/":[227,251],"{(\\log":[228,252],"n)^k}}":[230,254],"$O(n)$)":[233],"have":[237],"$O(\\log":[243],"n\\log":[244],"$O({{(\\log":[248],"n)^2":[249],"}":[250],")$).":[255],"Previously,":[256],"no":[257],"deterministic":[258],"was":[267],"known":[268],"problem.":[271]},"counts_by_year":[{"year":2023,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}