arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2007.11094cs.DScs.CG
收藏

用于正交距离报告和距离最小化的新数据结构

New Data Structures for Orthogonal Range Reporting and Range Minima Queries

Yakov Nekrich

摘要:

在本文中,我们提出了新的数据结构的两个广泛研究的正交范围搜索问题的变种。首先,我们描述了一个数据结构,支持二维正交范围最小查询$O(n)$空间和$O(\log^{\varepsilon} n)$时间,其中$n$是在数据结构中的点的数量和$\varepsilon$是一个任意小的正常数。先前已知的用于该问题的线性空间解决方案需要$O(\log^{1+\varepsilon} n)$(Chazelle,1988)或$O(\log n\log \log n)$时间(Farzan等人,2012年)。我们的数据结构的修改使用空间$O(n\log \log n)$,并支持范围最小查询的时间$O(\log \log n)$。这两个结果都可以扩展到支持三维五边报告查询。接下来,我们转向四维正交范围报告问题,并提出了一个数据结构,回答查询在最佳的$O(\log n/\log \log n + k)$时间,其中$k$是答案中的点数。这是第一个数据结构,实现了最佳的查询时间为这个问题。我们的结果是通过利用三维浅岩屑的性质。

英文摘要:

In this paper we present new data structures for two extensively studied variants of the orthogonal range searching problem. First, we describe a data structure that supports two-dimensional orthogonal range minima queries in $O(n)$ space and $O(\log^{\varepsilon} n)$ time, where $n$ is the number of points in the data structure and $\varepsilon$ is an arbitrarily small positive constant. Previously known linear-space solutions for this problem require $O(\log^{1+\varepsilon} n)$ (Chazelle, 1988) or $O(\log n\log \log n)$ time (Farzan et al., 2012). A modification of our data structure uses space $O(n\log \log n)$ and supports range minima queries in time $O(\log \log n)$. Both results can be extended to support three-dimensional five-sided reporting queries. Next, we turn to the four-dimensional orthogonal range reporting problem and present a data structure that answers queries in optimal $O(\log n/\log \log n + k)$ time, where $k$ is the number of points in the answer. This is the first data structure that achieves the optimal query time for this problem. Our results are obtained by exploiting the properties of three-dimensional shallow cuttings.

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

↑