New upper bounds for neighbor searching

Q4 Mathematics 信息与控制 Pub Date : 1986-01-01 DOI:10.1016/S0019-9958(86)80030-4
B. Chazelle , R. Cole , F.P. Preparata , C. Yap
{"title":"New upper bounds for neighbor searching","authors":"B. Chazelle ,&nbsp;R. Cole ,&nbsp;F.P. Preparata ,&nbsp;C. Yap","doi":"10.1016/S0019-9958(86)80030-4","DOIUrl":null,"url":null,"abstract":"<div><p>This paper investigates the circular retrieval problem and the <em>k</em>-nearest neighbor problem, for sets of <em>n</em> points in the Euclidean plane. Two similar data structures each solve both problems. A deterministic structure uses space <em>O</em>(<em>n</em>(log <em>n</em> log log <em>n</em>)<sup>2</sup>), and a probabilistic structure uses space <em>O</em>(<em>n</em> log<sup>2</sup> <em>n</em>). For both problems, these two structures answer a query that returns <em>k</em> points in <em>O</em>(<em>k</em> + log <em>n</em>) time.</p></div>","PeriodicalId":38164,"journal":{"name":"信息与控制","volume":"68 1","pages":"Pages 105-124"},"PeriodicalIF":0.0000,"publicationDate":"1986-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1016/S0019-9958(86)80030-4","citationCount":"19","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"信息与控制","FirstCategoryId":"1093","ListUrlMain":"https://www.sciencedirect.com/science/article/pii/S0019995886800304","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q4","JCRName":"Mathematics","Score":null,"Total":0}
引用次数: 19

Abstract

This paper investigates the circular retrieval problem and the k-nearest neighbor problem, for sets of n points in the Euclidean plane. Two similar data structures each solve both problems. A deterministic structure uses space O(n(log n log log n)2), and a probabilistic structure uses space O(n log2 n). For both problems, these two structures answer a query that returns k points in O(k + log n) time.

查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
新的邻居搜索的上界
本文研究了欧几里德平面上n个点的集合的圆检索问题和k近邻问题。两个类似的数据结构各自解决了这两个问题。确定性结构使用空间O(n(log n log n)2),概率结构使用空间O(n log2n)。对于这两个问题,这两种结构在O(k + log n)时间内回答一个返回k个点的查询。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
信息与控制
信息与控制 Mathematics-Control and Optimization
CiteScore
1.50
自引率
0.00%
发文量
4623
期刊介绍:
期刊最新文献
Systolic trellis automata: Stability, decidability and complexity On relativized exponential and probabilistic complexity classes A note on succinct representations of graphs Function definitions in term rewriting and applicative programming Simulation of large networks on smaller networks
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1