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

关于点集的极对最近对的复杂性

On the Complexity of Closest Pair via Polar-Pair of Point-Sets

Roee David, Karthik C. S., Bundit Laekhanukit

摘要:

每个图$G$可以由$d$维度量$Δ$中的等半径球体的集合表示,使得当且仅当对应于$u$和$v$的球体相交时,在$G$中存在边$uv$。使得$G$可以由$Δ$中的球体集合(所有的半径相同)表示的最小整数$d$被称为$G$的球度,并且如果球体集合不重叠,则值$d$被称为$G$的接触维度。本文研究了完全二部图$K_{n,n}$在不同的$L^p$ -度量下的球度和接触维数,从而将单色最近对和双色最近对问题的复杂性联系起来。

英文摘要:

Every graph $G$ can be represented by a collection of equi-radii spheres in a $d$-dimensional metric $Δ$ such that there is an edge $uv$ in $G$ if and only if the spheres corresponding to $u$ and $v$ intersect. The smallest integer $d$ such that $G$ can be represented by a collection of spheres (all of the same radius) in $Δ$ is called the sphericity of $G$, and if the collection of spheres are non-overlapping, then the value $d$ is called the contact-dimension of $G$. In this paper, we study the sphericity and contact dimension of the complete bipartite graph $K_{n,n}$ in various $L^p$-metrics and consequently connect the complexity of the monochromatic closest pair and bichromatic closest pair problems.

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

↑