[{"_1":2,"_3":-5,"_4":-5},"loaderData",{"_5":6,"_7":8,"_9":10},"actionData","errors","root",{"_266":267},"routes/_layout",{"_11":186},"routes/entity.$type.$id",{"_11":12,"_13":14,"_15":16,"_17":18,"_19":20,"_21":22,"_23":24,"_25":26,"_27":28},"dehydratedState",{"_73":74,"_75":76},"type","paper","id","paper_W2161449253","section","technologies","entity",{"_15":16,"_29":30,"_31":-5,"_32":-5,"_33":-5,"_34":-5,"_35":36,"_37":38,"_39":-5,"_40":41,"_42":43,"_44":45,"_46":47,"_48":-5,"_49":50,"_51":30,"_52":53,"_54":55,"_56":57,"_58":-5,"_59":60,"_61":-5,"_62":63,"_64":65,"_66":67,"_68":30,"_69":-5},"canonical","https://www.hugmap.com/entity/paper/paper_W2161449253/technologies","siteBaseUrl","https://www.hugmap.com","sectionCount",3,"jsonLd","{\"@context\":\"https://schema.org\",\"@graph\":[{\"name\":\"K-d trees for semidynamic point sets\",\"url\":\"https://www.hugmap.com/entity/paper/paper_W2161449253/technologies\",\"@type\":\"ScholarlyArticle\",\"headline\":\"K-d trees for semidynamic point sets\",\"datePublished\":\"1990-01-01\"},{\"@type\":\"CollectionPage\",\"name\":\"K-d trees for semidynamic point sets 相关技术\",\"description\":\"K-d trees for semidynamic point sets 在 HugMap 中的相关技术，共 3 条，含结构化关联信息与详情链接。\",\"url\":\"https://www.hugmap.com/entity/paper/paper_W2161449253/technologies\",\"inLanguage\":\"zh-CN\"},{\"@type\":\"BreadcrumbList\",\"itemListElement\":[{\"@type\":\"ListItem\",\"position\":1,\"name\":\"首页\",\"item\":\"https://www.hugmap.com/\"},{\"@type\":\"ListItem\",\"position\":2,\"name\":\"论文\",\"item\":\"https://www.hugmap.com/search?type=paper\"},{\"@type\":\"ListItem\",\"position\":3,\"name\":\"K-d trees for semidynamic point sets\",\"item\":\"https://www.hugmap.com/entity/paper/paper_W2161449253\"},{\"@type\":\"ListItem\",\"position\":4,\"name\":\"相关技术\",\"item\":\"https://www.hugmap.com/entity/paper/paper_W2161449253/technologies\"}]}]}","name","K-d trees for semidynamic point sets","nameZh","aliases","description","descriptionZh","status","active","externalIds","{\"openalex\":\"W2161449253\",\"doi\":\"10.1145/98524.98564\"}","properties","source","openalex","createdAt","2026-05-20T07:43:17.224763971","updatedAt","2026-05-20T07:43:17.23204309","doi","10.1145/98524.98564","arxivId","openalexId","W2161449253","title","abstractText","A K-d tree represents a set of N points in K-dimensional space. Operations on a semidynamic tree may delete and undelete points, but may not insert new points. This paper shows that several operations that require Ο(log N) expected time in general K-d trees may be performed in constant expected time in semidynamic trees. These operations include deletion, undeletion, nearest neighbor searching, and fixed-radius near neighbor searching (the running times of the first two are proved, while the last two are supported by experiments and heuristic arguments). Other new techniques can also be applied to general K-d trees: simple sampling reduces the time to build a tree from Ο(KN log N) to Ο(KN + N log N), and more advanced sampling builds a robust tree in the same time. The methods are straightforward to implement, and lead to a data structure that is significantly faster and less vulnerable to pathological inputs than ordinary K-d trees.","publishedDate","1990-01-01","publishedYear",1990,"venue","citationCount",344,"authors","keywords",[70,71,72],"pdfUrl","https://dl.acm.org/doi/pdf/10.1145/98524.98564","topVenue",false,"displayName","displayDescription","Data Management and Algorithms","Computational Geometry and Mesh Generation","Graph Theory and Algorithms","mutations",[],"queries",[77],{"_78":79,"_80":81,"_82":83,"_84":85},"dehydratedAt",1781695010557,"state",{"_87":88,"_89":90,"_91":79,"_92":-5,"_93":94,"_95":94,"_96":94,"_97":-5,"_98":-5,"_99":67,"_35":100,"_101":102},"queryKey",[86,19,14,16],"queryHash","[\"portal\",\"entity\",\"paper\",\"paper_W2161449253\"]","portal","data",{"_19":20,"_103":104,"_105":106,"_107":108,"_109":110,"_18":111,"_61":112},"dataUpdateCount",1,"dataUpdatedAt","error","errorUpdateCount",0,"errorUpdatedAt","fetchFailureCount","fetchFailureReason","fetchMeta","isInvalidated","success","fetchStatus","idle","entityType","Paper","taxonomies",[154,155,156],"events",[],"articles",[],[128,129,130],[113],{"_15":114,"_29":115,"_31":-5,"_32":-5,"_33":-5,"_34":-5,"_35":36,"_37":116,"_39":-5,"_40":41,"_42":117,"_44":118,"_119":-5,"_51":-5,"_120":-5,"_121":-5,"_122":-5,"_59":-5,"_123":-5,"_124":-5,"_125":-5,"_126":-5,"_127":-5,"_68":115,"_69":-5},"person_A5109990155","Jon Bentley","{\"openalex\":\"A5109990155\"}","2026-05-14T01:02:26.312067715","2026-05-22T16:06:33.448903665","orcid","affiliation","researchArea","paperCount","homepage","linkedin","twitter","github","hindex",{"_15":150,"_29":70,"_31":-5,"_32":-5,"_33":-5,"_34":-5,"_35":36,"_37":151,"_39":-5,"_40":133,"_42":152,"_44":153,"_136":149,"_138":139,"_140":-5,"_141":142,"_143":-5,"_122":-5,"_144":-5,"_68":70,"_69":-5},{"_15":145,"_29":72,"_31":-5,"_32":-5,"_33":-5,"_34":-5,"_35":36,"_37":146,"_39":-5,"_40":133,"_42":147,"_44":148,"_136":149,"_138":139,"_140":-5,"_141":142,"_143":-5,"_122":-5,"_144":-5,"_68":72,"_69":-5},{"_15":131,"_29":71,"_31":-5,"_32":-5,"_33":-5,"_34":-5,"_35":36,"_37":132,"_39":-5,"_40":133,"_42":134,"_44":135,"_136":137,"_138":139,"_140":-5,"_141":142,"_143":-5,"_122":-5,"_144":-5,"_68":71,"_69":-5},"tech_oa_T10996","{\"taxonomy_id\":\"tax_rd_T10996\"}","openalex_topics","2026-05-17T09:00:39.190592914","2026-05-17T09:00:39.190595271","techType","concept","domain","Physical Sciences","proposedYear","maturityLevel","growing","wikipediaUrl","patentCount","tech_oa_T12292","{\"taxonomy_id\":\"tax_rd_T12292\"}","2026-05-17T09:00:31.307195043","2026-05-17T09:00:31.307196938","algorithm","tech_oa_T11106","{\"taxonomy_id\":\"tax_rd_T11106\"}","2026-05-17T09:00:11.245194282","2026-05-17T09:00:11.245197583",{"_15":180,"_29":70,"_31":-5,"_32":-5,"_33":-5,"_34":-5,"_35":36,"_37":181,"_39":-5,"_40":41,"_42":182,"_44":183,"_161":162,"_163":-5,"_164":26,"_165":184,"_167":185,"_169":94,"_170":171,"_172":94,"_173":-5,"_68":70,"_69":-5},{"_15":174,"_29":72,"_31":-5,"_32":-5,"_33":-5,"_34":-5,"_35":36,"_37":175,"_39":-5,"_40":41,"_42":176,"_44":177,"_161":162,"_163":-5,"_164":26,"_165":178,"_167":179,"_169":94,"_170":171,"_172":94,"_173":-5,"_68":72,"_69":-5},{"_15":157,"_29":71,"_31":-5,"_32":-5,"_33":-5,"_34":-5,"_35":36,"_37":158,"_39":-5,"_40":41,"_42":159,"_44":160,"_161":162,"_163":-5,"_164":26,"_165":166,"_167":168,"_169":94,"_170":171,"_172":94,"_173":-5,"_68":71,"_69":-5},"tax_rd_T10996","{\"openalex_topic\":\"T10996\"}","2026-05-14T01:25:09.227963057","2026-05-23T12:17:06.283926384","taxonomyType","RESEARCH_DOMAIN","code","level","parentId","tax_rd_1704","path","Physical Sciences/Computer Science/Computer Graphics and Computer-Aided Design/Computational Geometry and Mesh Generation","sortOrder","isLeaf",true,"entityCount","children","tax_rd_T12292","{\"openalex_topic\":\"T12292\"}","2026-05-14T00:51:38.708429699","2026-05-23T12:27:52.247825871","tax_rd_1707","Physical Sciences/Computer Science/Computer Vision and Pattern Recognition/Graph Theory and Algorithms","tax_rd_T11106","{\"openalex_topic\":\"T11106\"}","2026-05-14T00:29:16.292968991","2026-05-23T12:38:06.251863399","tax_rd_1711","Physical Sciences/Computer Science/Signal Processing/Data Management and Algorithms",{"_73":187,"_75":188},[],[189],{"_78":190,"_80":191,"_82":192,"_84":193},1781695008335,{"_87":195,"_89":90,"_91":190,"_92":-5,"_93":94,"_95":94,"_96":94,"_97":-5,"_98":-5,"_99":67,"_35":100,"_101":102},[86,194],"[\"portal\",\"industries\"]","industries",[196,197,198,199,200,201,202,203,204,205,206,207],{"_15":259,"_29":260,"_31":-5,"_32":261,"_33":262,"_34":-5,"_35":36,"_37":-5,"_39":-5,"_40":211,"_42":-5,"_44":-5,"_161":212,"_163":-5,"_164":90,"_165":213,"_167":263,"_169":94,"_170":67,"_172":94,"_173":-5,"_68":260,"_69":262},{"_15":255,"_29":256,"_31":-5,"_32":-5,"_33":257,"_34":-5,"_35":36,"_37":-5,"_39":-5,"_40":211,"_42":-5,"_44":-5,"_161":212,"_163":-5,"_164":90,"_165":213,"_167":258,"_169":94,"_170":67,"_172":94,"_173":-5,"_68":256,"_69":257},{"_15":249,"_29":250,"_31":-5,"_32":251,"_33":252,"_34":-5,"_35":36,"_37":-5,"_39":-5,"_40":211,"_42":-5,"_44":-5,"_161":212,"_163":-5,"_164":90,"_165":213,"_167":253,"_169":94,"_170":67,"_172":94,"_173":-5,"_68":250,"_69":252},{"_15":245,"_29":246,"_31":-5,"_32":-5,"_33":247,"_34":-5,"_35":36,"_37":-5,"_39":-5,"_40":211,"_42":-5,"_44":-5,"_161":212,"_163":-5,"_164":90,"_165":213,"_167":248,"_169":94,"_170":67,"_172":94,"_173":-5,"_68":246,"_69":247},{"_15":241,"_29":242,"_31":-5,"_32":-5,"_33":243,"_34":-5,"_35":36,"_37":-5,"_39":-5,"_40":211,"_42":-5,"_44":-5,"_161":212,"_163":-5,"_164":90,"_165":213,"_167":244,"_169":94,"_170":67,"_172":94,"_173":-5,"_68":242,"_69":243},{"_15":235,"_29":236,"_31":-5,"_32":237,"_33":238,"_34":-5,"_35":36,"_37":-5,"_39":-5,"_40":211,"_42":-5,"_44":-5,"_161":212,"_163":-5,"_164":90,"_165":213,"_167":239,"_169":94,"_170":67,"_172":94,"_173":-5,"_68":236,"_69":238},{"_15":231,"_29":232,"_31":-5,"_32":-5,"_33":233,"_34":-5,"_35":36,"_37":-5,"_39":-5,"_40":211,"_42":-5,"_44":-5,"_161":212,"_163":-5,"_164":90,"_165":213,"_167":234,"_169":94,"_170":171,"_172":94,"_173":-5,"_68":232,"_69":233},{"_15":227,"_29":228,"_31":-5,"_32":-5,"_33":229,"_34":-5,"_35":36,"_37":-5,"_39":-5,"_40":211,"_42":-5,"_44":-5,"_161":212,"_163":-5,"_164":90,"_165":213,"_167":230,"_169":94,"_170":67,"_172":94,"_173":-5,"_68":228,"_69":229},{"_15":223,"_29":224,"_31":-5,"_32":-5,"_33":225,"_34":-5,"_35":36,"_37":-5,"_39":-5,"_40":211,"_42":-5,"_44":-5,"_161":212,"_163":-5,"_164":90,"_165":213,"_167":226,"_169":94,"_170":67,"_172":94,"_173":-5,"_68":224,"_69":225},{"_15":219,"_29":220,"_31":-5,"_32":-5,"_33":221,"_34":-5,"_35":36,"_37":-5,"_39":-5,"_40":211,"_42":-5,"_44":-5,"_161":212,"_163":-5,"_164":90,"_165":213,"_167":222,"_169":94,"_170":67,"_172":94,"_173":-5,"_68":220,"_69":221},{"_15":215,"_29":216,"_31":-5,"_32":-5,"_33":217,"_34":-5,"_35":36,"_37":-5,"_39":-5,"_40":211,"_42":-5,"_44":-5,"_161":212,"_163":-5,"_164":90,"_165":213,"_167":218,"_169":94,"_170":67,"_172":94,"_173":-5,"_68":216,"_69":217},{"_15":208,"_29":209,"_31":-5,"_32":-5,"_33":210,"_34":-5,"_35":36,"_37":-5,"_39":-5,"_40":211,"_42":-5,"_44":-5,"_161":212,"_163":-5,"_164":90,"_165":213,"_167":214,"_169":94,"_170":67,"_172":94,"_173":-5,"_68":209,"_69":210},"tax_ind_smartphone","智能手机","Smartphone","manual","INDUSTRY","tax_ind_root","科技行业/智能手机","tax_ind_robot","机器人","Robotics","科技行业/机器人","tax_ind_wearable","智能穿戴","Smart Wearables","科技行业/智能穿戴","tax_ind_energy","新能源与智能制造","New Energy & Smart Manufacturing","科技行业/新能源与智能制造","tax_ind_biotech","生物科技","Biotech","科技行业/生物科技","tax_ind_quantum","量子计算","Quantum Computing","科技行业/量子计算","tax_ind_blockchain","区块链",[240],"Blockchain","科技行业/区块链","Web3","tax_ind_enterprise","企业软件","Enterprise Software","科技行业/企业软件","tax_ind_security","网络安全","Cybersecurity","科技行业/网络安全","tax_ind_semi","半导体",[254],"Semiconductor","科技行业/半导体","芯片","tax_ind_cloud","云计算","Cloud Computing","科技行业/云计算","tax_ind_ai","人工智能",[264,265],"Artificial Intelligence","科技行业/人工智能","AI","AI 技术","env",{"_268":24},"SITE_BASE_URL"]

<i>K</i>-d trees for semidynamic point sets 论文

<i>K</i>-d trees for semidynamic point sets · 相关技术

相关技术