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

凸点集的线性平面Manhattan网络

Linear Size Planar Manhattan Network for Convex Point Sets

Satyabrata Jana, Anil Maheshwari, Sasanka Roy

摘要:

设$G = (V, E)$是一个边加权几何图,使得每条边都是水平或垂直的.边$uv \in E$的权是它的长度。令$ W_G (u,v)$表示$G$中一对顶点$u$和$v$之间的最短路径的长度。如果$P \subseteq V$和$\forall p,q \in P$,$ W_G (p,q)=|pq|_1$是平面上给定点集$ P $的图$G$称为曼哈顿网络.除了$ P$之外,图$G$还可以在其顶点集合$V$中包括Steiner点的集合$T$。在曼哈顿网络问题中,目标是为一组$ n $点构造一个小尺寸的曼哈顿网络。这个问题首先由Gudmundsson等人\cite{gudmundsson2007small}考虑。给出了平面上一般点集的一个大小为$Θ(n \log n)$的曼哈顿网络的构造。我们说曼哈顿网络是平面的,如果它可以嵌入平面中而没有任何边交叉。本文利用$\mathcal{ O}(n)$ Steiner点构造了线性时间凸点集的线性尺寸平面Manhattan网络。我们还证明了,即使对于凸点集,Gudmundsson等人的\cite{gudmundsson2007small}的构造也需要$Ω(n \log n)$ Steiner点,并且网络可能不是平面的.

英文摘要:

Let $G = (V, E)$ be an edge-weighted geometric graph such that every edge is horizontal or vertical. The weight of an edge $uv \in E$ is its length. Let $ W_G (u,v)$ denote the length of a shortest path between a pair of vertices $u$ and $v$ in $G$. The graph $G$ is said to be a Manhattan network for a given point set $ P $ in the plane if $P \subseteq V$ and $\forall p,q \in P$, $ W_G (p,q)=|pq|_1$. In addition to $ P$, graph $G$ may also include a set $T$ of Steiner points in its vertex set $V$. In the Manhattan network problem, the objective is to construct a Manhattan network of small size for a set of $ n $ points. This problem was first considered by Gudmundsson et al.\cite{gudmundsson2007small}. They give a construction of a Manhattan network of size $Θ(n \log n)$ for general point set in the plane. We say a Manhattan network is planar if it can be embedded in the plane without any edge crossings. In this paper, we construct a linear size planar Manhattan network for convex point set in linear time using $\mathcal{ O}(n)$ Steiner points. We also show that, even for convex point set, the construction in Gudmundsson et al. \cite{gudmundsson2007small} needs $Ω(n \log n)$ Steiner points and the network may not be planar.

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

↑