一般距离函数下的有色值域最近对问题
Colored range closest-pair problem under general distance functions
摘要:
范围最近对(RCP)问题是经典最近对问题的范围搜索版本,其目的是将给定的点数据集存储在某种数据结构中,使得当指定查询范围$X$时,$X$中包含的最近点对可以被有效地报告。RCP问题的一个自然推广是{有色范围最近对}(CRCP)问题,其中给定的数据点是有色的,目标是找到查询范围中包含的最接近的{双色}对。所有以前的工作都局限于RCP问题的无色版本和欧几里德距离函数。本文对CRCP问题进行了初步的研究。我们调查的问题下,一般的距离函数引起的单调规范,特别是,这涵盖了所有的$L_p$度量$p > 0$和$L_\infty$度量。我们设计了高效的$(1+\varepsilon)$ -近似CRCP数据结构的正交查询在$\mathbb{R}^2$,其中$\varepsilon>0$是一个预先指定的参数。重点是用于回答矩形查询的两种数据结构,其中一种使用$O(\varepsilon^{-1} n \log^4 n)$空间和$O(\log^4 n + \varepsilon^{-1} \log^3 n + \varepsilon^{-2} \log n)$查询时间,而另一种使用$O(\varepsilon^{-1} n \log^3 n)$空间和$O(\log^5 n + \varepsilon^{-1} \log^4 n + \varepsilon^{-2} \log^2 n)$查询时间。此外,我们还将我们的技术应用于更高维度的CRCP问题,获得有效的数据结构板,2盒和3D优势查询。在本文之前,几乎所有关于RCP问题的已有结果都是在$\mathbb{R}^2$中得到的。
英文摘要:
The range closest-pair (RCP) problem is the range-search version of the classical closest-pair problem, which aims to store a given dataset of points in some data structure such that when a query range $X$ is specified, the closest pair of points contained in $X$ can be reported efficiently. A natural generalization of the RCP problem is the {colored range closest-pair} (CRCP) problem in which the given data points are colored and the goal is to find the closest {bichromatic} pair contained in the query range. All the previous work on the RCP problem was restricted to the uncolored version and the Euclidean distance function. In this paper, we make the first progress on the CRCP problem. We investigate the problem under a general distance function induced by a monotone norm; in particular, this covers all the $L_p$-metrics for $p > 0$ and the $L_\infty$-metric. We design efficient $(1+\varepsilon)$-approximate CRCP data structures for orthogonal queries in $\mathbb{R}^2$, where $\varepsilon>0$ is a pre-specified parameter. The highlights are two data structures for answering rectangle queries, one of which uses $O(\varepsilon^{-1} n \log^4 n)$ space and $O(\log^4 n + \varepsilon^{-1} \log^3 n + \varepsilon^{-2} \log n)$ query time while the other uses $O(\varepsilon^{-1} n \log^3 n)$ space and $O(\log^5 n + \varepsilon^{-1} \log^4 n + \varepsilon^{-2} \log^2 n)$ query time. In addition, we also apply our techniques to the CRCP problem in higher dimensions, obtaining efficient data structures for slab, 2-box, and 3D dominance queries. Before this paper, almost all the existing results for the RCP problem were achieved in $\mathbb{R}^2$.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。