arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1001.2862cs.DMcs.DS
收藏

关于接触三角图

On Touching Triangle Graphs

Emden R. Gansner, Yifan Hu, Stephen G. Kobourov

摘要:

本文考虑用边相交的三角形表示图的问题。作为一个简单的必要条件,我们证明了顶点对必须有一个小的公共邻域。在积极的一面,我们提出了线性时间算法创建触摸三角形表示外平面图,正方形网格图,六边形网格图。我们注意到,这类图在未成年人下是不封闭的,这使得刻画困难。然而,我们提出了一个完整的特征的子类的双连通图,可以表示为一些多边形的三角剖分。

英文摘要:

In this paper, we consider the problem of representing graphs by triangles whose sides touch. As a simple necessary condition, we show that pairs of vertices must have a small common neighborhood. On the positive side, we present linear time algorithms for creating touching triangle representations for outerplanar graphs, square grid graphs, and hexagonal grid graphs. We note that this class of graphs is not closed under minors, making characterization difficult. However, we present a complete characterization of the subclass of biconnected graphs that can be represented as triangulations of some polygon.

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

↑