arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2109.01692cs.CG
收藏

1-平面图的直线图

Straight-line Drawings of 1-Planar Graphs

Franz J. Brandenburg

摘要:

一个图是1-平面的,如果它可以画在平面上,使每个边最多交叉一次。然而,有1-平面图不承认直线1-平面图。我们证明了每一个1-平面图都有一个直线图,它的边是双染色的,所以相同颜色的边不会相交。因此,1-平面图的几何厚度为2。此外,如果每条边被交叉两次以上,则每条边被具有公共顶点的边交叉。绘图使用高精度算法,数字为O(nlog n)位,可以在线性时间内从1-平面绘图计算

英文摘要:

A graph is 1-planar if it can be drawn in the plane so that each edge is crossed at most once. However, there are 1-planar graphs which do not admit a straight-line 1-planar drawing. We show that every 1-planar graph has a straight-line drawing with a two-coloring of the edges, so that edges of the same color do not cross. Hence, 1-planar graphs have geometric thickness two. In addition, each edge is crossed by edges with a common vertex if it is crossed more than twice. The drawings use high precision arithmetic with numbers with O(n log n) digits and can be computed in linear time from a 1-planar drawing

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

↑