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

平面3-树点集嵌入问题的改进算法

Improved Algorithms for the Point-Set Embeddability problem for Plane 3-Trees

Tanaeem M. Moosa, M. Sohel Rahman

摘要:

在点集可嵌入性问题中,我们给出了一个顶点为$n$的平面图$G$和一个点集为$n$的点集$S$.现在的目标是回答以下问题:是否存在$G$的直线图,使得每个顶点都表示为$S$的不同点;如果存在,则提供嵌入。最近,在\cite{DBLP:conf/gd/NishatMR10}中,给出了这一问题在一类特殊的图--平面3-树上的完整刻画,并给出了解决这一问题的有效算法。在本文中,我们使用相同的特征设计一个改进的算法相同的问题。我们实现的效率大部分来自于三角范围搜索技术的巧妙使用。我们还研究了一个广义版本的问题,并提出了改进的算法,这个版本的问题。

英文摘要:

In the point set embeddability problem, we are given a plane graph $G$ with $n$ vertices and a point set $S$ with $n$ points. Now the goal is to answer the question whether there exists a straight-line drawing of $G$ such that each vertex is represented as a distinct point of $S$ as well as to provide an embedding if one does exist. Recently, in \cite{DBLP:conf/gd/NishatMR10}, a complete characterization for this problem on a special class of graphs known as the plane 3-trees was presented along with an efficient algorithm to solve the problem. In this paper, we use the same characterization to devise an improved algorithm for the same problem. Much of the efficiency we achieve comes from clever uses of the triangular range search technique. We also study a generalized version of the problem and present improved algorithms for this version of the problem as well.

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

↑