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

高维情形下的值域Faradian点映射及相关问题

In-Range Farthest Point Queries and Related Problem in High Dimensions

Ziyun Huang, Jinhui Xu

摘要:

范围聚集查询是一种重要的查询类型,有着广泛的应用。它的目的是获得一些结构信息(由聚合函数$F(\cdot)$定义)的点(从一个点集$P$)在一个给定的查询范围$B$。本文研究了高维空间中两个聚集函数的范围聚集查询问题:(1)$F(P \cap B)$是$P \cap B$中到$\mathbb{R}^d$中查询点$q$的最远点;(2)$F(P \cap B)$是$P \cap B$的最小包围球(MEB).对于问题(1),称为范围内Faraday点(IFP)查询,我们开发了一个双标准近似方案:对于指定最远距离的近似比率的任何$ε>0$和测量查询范围的“模糊度”的任何$γ>0$,我们表明,这是可能的预-在$\tilde{O}_{ε,γ}(dn^{1+ρ})$时间内将$P$处理成大小为$\tilde{O}_{ε,γ}(dn^{1+ρ})$的数据结构,使得给定任何$\mathbb{R}^d$查询球$B$和查询点$q$,它在$\tilde{O}_{ε,γ}(dn^ρ)$时间内输出点$p$,该点$p$是位于$B$的$(1+γ)$ -扩展$B(1+γ)$中的所有点中的最远点到$q$的$(1-ε)$ -近似,其中$0<ρ<1$是取决于$ε$和$γ$的常数,并且大0符号中的隐藏常数仅取决于$ε$、$γ$和$\text{Polylog}(nd)$。对于问题(2),我们证明了IFP的结果可以应用于开发具有相似时间和空间复杂度的查询方案,以实现MEB的$(1+ε)$ -近似。

英文摘要:

Range-aggregate query is an important type of queries with numerous applications. It aims to obtain some structural information (defined by an aggregate function $F(\cdot)$) of the points (from a point set $P$) inside a given query range $B$. In this paper, we study the range-aggregate query problem in high dimensional space for two aggregate functions: (1) $F(P \cap B)$ is the farthest point in $P \cap B$ to a query point $q$ in $\mathbb{R}^d$ and (2) $F(P \cap B)$ is the minimum enclosing ball (MEB) of $P \cap B$. For problem (1), called In-Range Farthest Point (IFP) Query, we develop a bi-criteria approximation scheme: For any $ε>0$ that specifies the approximation ratio of the farthest distance and any $γ>0$ that measures the "fuzziness" of the query range, we show that it is possible to pre-process $P$ into a data structure of size $\tilde{O}_{ε,γ}(dn^{1+ρ})$ in $\tilde{O}_{ε,γ}(dn^{1+ρ})$ time such that given any $\mathbb{R}^d$ query ball $B$ and query point $q$, it outputs in $\tilde{O}_{ε,γ}(dn^ρ)$ time a point $p$ that is a $(1-ε)$-approximation of the farthest point to $q$ among all points lying in a $(1+γ)$-expansion $B(1+γ)$ of $B$, where $0<ρ<1$ is a constant depending on $ε$ and $γ$ and the hidden constants in big-O notations depend only on $ε$, $γ$ and $\text{Polylog}(nd)$. For problem (2), we show that the IFP result can be applied to develop query scheme with similar time and space complexities to achieve a $(1+ε)$-approximation for MEB.

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

↑