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

用正交交叉作图

Drawing Graphs with Orthogonal Crossings

Radoslav Fulek, Balázs Keszegh, Filip Morić

摘要:

通过在n个顶点上画一个图G的折线图,我们可以理解G在平面上的一个图,使得每个边都由连接其两个相应顶点的多边形弧表示。我们把多边形弧的转折点称为弯曲。我们考虑一类图,承认一个多线绘图,其中每一个边缘有最多一个弯曲(分别。两个弯曲)并且任何两个边缘只能以直角相交。证明了这类图的边数至多为O(n)(resp.时间复杂度O(n \log^2 n))。这加强了Didimo等人最近的结果。

英文摘要:

By a poly-line drawing of a graph G on n vertices we understand a drawing of G in the plane such that each edge is represented by a polygonal arc joining its two respective vertices. We call a turning point of a polygonal arc the bend. We consider the class of graphs that admit a poly-line drawing, in which each edge has at most one bend (resp. two bends) and any two edges can cross only at a right angle. It is shown that the number of edges of such graphs is at most O(n) (resp. O(n \log^2 n)). This is a strengthening of a recent result of Didimo et al.

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

↑