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

在三维空间中基于一般度量的动态最近邻搜索及其应用

Dynamic Nearest-Neighbor Searching Under General Metrics in ${\mathbb R}^3$ and Its Applications

Duke University(杜克大学);Ben-Gurion University of the Negev(内盖夫本古里安大学);Tel Aviv University(特拉维夫大学)

Pankaj K. Agarwal, Matthew J. Katz, Micha Sharir

AI总结:

本文提出了一种在三维空间中基于一般度量的动态最近邻搜索数据结构,支持高效查询和插入删除操作,并应用于图遍历和最短路径算法。

摘要:

设K为三维空间中的紧致、中心对称、严格凸区域,是一个具有常数复杂度的半代数集,即对应度量的单位球,记为‖⋅‖_K。设K为n个K的同构副本集合。本文包含两个主要结果:(i) 对于存储参数s∈[n,n³],K可以在O*(s)的期望时间内预处理成大小为O*(s)的数据结构,使得对于查询同构体K₀,可以以O*(n/s^{1/3})的时间回答交集检测查询或最近邻查询;此外,所有与K₀相交的K的k个同构体可以以O(k)的时间报告。此外,该数据结构支持在O*(s/n)的均摊期望时间内进行插入/删除操作。这里O*(⋅)的记号隐藏了形式为n^ε的因素,其中ε>0是一个任意小的常数,比例常数依赖于ε。(ii) 设G(K)为K的交集图。利用上述数据结构,可以在O*(n^{3/2})的期望时间内进行G(K)的广度优先或深度优先搜索。结合所谓的收缩和分叉技术,可以在O*(n^{62/39})的期望时间内解决合适定义的接近图中的反向最短路径问题。Dijkstra最短路径算法以及Prim最小生成树算法在三维空间中的‖⋅‖_K接近图上,边权为‖⋅‖_K,也可以在O*(n^{3/2})时间内完成。

英文摘要:

Let $K$ be a compact, centrally-symmetric, strictly-convex region in ${\mathbb R}^3$, which is a semi-algebraic set of constant complexity, i.e. the unit ball of a corresponding metric, denoted as $\|\cdot\|_K$. Let ${\mathcal{K}}$ be a set of $n$ homothetic copies of $K$. This paper contains two main sets of results: (i) For a storage parameter $s\in[n,n^3]$, ${\mathcal{K}}$ can be preprocessed in $O^*(s)$ expected time into a data structure of size $O^*(s)$, so that for a query homothet $K_0$ of $K$, an intersection-detection query (determine whether $K_0$ intersects any member of ${\mathcal{K}}$, and if so, report such a member) or a nearest-neighbor query (return the member of ${\mathcal{K}}$ whose $\|\cdot\|_K$-distance from $K_0$ is smallest) can be answered in $O^*(n/s^{1/3})$ time; all $k$ homothets of ${\mathcal{K}}$ intersecting $K_0$ can be reported in additional $O(k)$ time. In addition, the data structure supports insertions/deletions in $O^*(s/n)$ amortized expected time per operation. Here the $O^*(\cdot)$ notation hides factors of the form $n^\varepsilon$, where $\varepsilon>0$ is an arbitrarily small constant, and the constant of proportionality depends on $\varepsilon$. (ii) Let $\mathcal{G}(\mathcal{K})$ denote the intersection graph of ${\mathcal{K}}$. Using the above data structure, breadth-first or depth-first search on $\mathcal{G}(\mathcal{K})$ can be performed in $O^*(n^{3/2})$ expected time. Combining this result with the so-called shrink-and-bifurcate technique, the reverse-shortest-path problem in a suitably defined proximity graph of ${\mathcal{K}}$ can be solved in $O^*(n^{62/39})$ expected time. Dijkstra's shortest-path algorithm, as well as Prim's MST algorithm, on a $\|\cdot\|_K$-proximity graph on $n$ points in ${\mathbb R}^3$, with edges weighted by $\|\cdot\|_K$, can also be performed in $O^*(n^{3/2})$ time.

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

↑