arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 1008.1480cs.DS
收藏

快速、精确和动态的距离查询

Fast, precise and dynamic distance queries

Yair Bartal, Lee-Ad Gottlieb, Tsvi Kopelowitz, Moshe Lewenstein, Liam Roditty

摘要:

本文给出了具有n个点且维数为λ的点集S的一个近似距离预言。对于任意ε>0,该预言机支持(1+ε)-近似距离查询,时间为(普适)常数,占用空间为[ε^{-O(λ)} + 2^{O(λ log λ)}]n,构造时间为[2^{O(λ)} log 3 n + ε^{-O(λ)} + 2^{O(λ log λ)}]n.这改进了由Har-Peled和Mendel提出的最好的先前已知的结构。此外,可以使预言机完全动态,预期的查询时间为O(1),更新时间仅为2^{O(λ)} log n + ε^{-O(λ)} + 2^{O(λ log λ)}。这是第一个完全动态的(1+ε)距离预言机。

英文摘要:

We present an approximate distance oracle for a point set S with n points and doubling dimension λ. For every ε>0, the oracle supports (1+ε)-approximate distance queries in (universal) constant time, occupies space [ε^{-O(λ)} + 2^{O(λ log λ)}]n, and can be constructed in [2^{O(λ)} log3 n + ε^{-O(λ)} + 2^{O(λ log λ)}]n expected time. This improves upon the best previously known constructions, presented by Har-Peled and Mendel. Furthermore, the oracle can be made fully dynamic with expected O(1) query time and only 2^{O(λ)} log n + ε^{-O(λ)} + 2^{O(λ log λ)} update time. This is the first fully dynamic (1+ε)-distance oracle.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑