关于近似瓶颈距离指标点集的一个注记
A Note on Indexing Point Sets for Approximate Bottleneck Distance Queries
摘要:
{ \em瓶颈距离}是两个基数相等的有限点集之间的距离的自然度量,定义为点集之间的所有双射中的最小值,该最小值是由双射对应的任何一对点之间的最大距离。在这项工作中,我们考虑的问题,建立一个数据结构$\mathbb{D}$索引的$m$平面点集(不同大小)的集合,并支持最近的瓶颈距离查询:给定一个查询点集$Q$的大小$n$,我们想找到的点集(S)$P \in \mathbb{D}$的大小$n$是最接近的瓶颈距离。不失一般性,我们假设所有的点集属于单位盒$[0,1]^2$在平面上,并专注于$L_\infty$规范,虽然技术也可以用于其他规范。主要贡献是基于{ \em trie}的数据结构在$O(-\lg(d_B(\mathbb{D},Q)) n)$时间内找到$6$ -近似最近邻,其中$d_B(\mathbb{D},Q)$是从$Q$到$\mathbb{D}$中任何点集的最小瓶颈距离。
英文摘要:
The {\em bottleneck distance} is a natural measure of the distance between two finite point sets of equal cardinality, defined as the minimum over all bijections between the point sets of the maximum distance between any pair of points put in correspondence by the bijection. In this work, we consider the problem of building a data structure $\mathbb{D}$ that indexes a collection of $m$ planar point sets (of varying sizes) and supports nearest bottleneck distance queries: given a query point set $Q$ of size $n$, we would like to find the point set(s) $P \in \mathbb{D}$ of size $n$ that are closest in terms of bottleneck distance. Without loss of generality, we assume that all point sets belong to the unit box $[0,1]^2$ in the plane and focus on the $L_\infty$ norm, although the techniques can also be used for other norms. The main contribution is a {\em trie}-based data structure finds a $6$-approximate nearest neighbor in $O(-\lg(d_B(\mathbb{D},Q)) n)$ time, where $d_B(\mathbb{D},Q)$ is the minimum bottleneck distance from $Q$ to any point set in $\mathbb{D}$.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。