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

测地图中最短路径的绘制

Drawing Shortest Paths in Geodetic Graphs

Sabine Cornelsen, Maximilian Pfister, Henry Förster, Martin Gronemann, Michael Hoffmann, Stephen Kobourov, Thomas Schneck

摘要:

在最短路径唯一的空间中,没有两条最短路径相交两次,基于这一事实,我们研究了Greg Bodwin提出的一个问题:给定一个测地图$G$,即,一个未加权图,其中任何一对顶点之间的最短路径是唯一的,是否存在$G$的哲学地理图,即,一幅$G$的图,其中任意两条最短路径的曲线至多相交一次?我们回答这个问题的否定,显示存在的测地图,需要一些对最短路径交叉至少四次。我们构造的图类的交叉数的界是紧的。此外,我们展示了直径为2,不承认philogedetic绘图的大地图。

英文摘要:

Motivated by the fact that in a space where shortest paths are unique, no two shortest paths meet twice, we study a question posed by Greg Bodwin: Given a geodetic graph $G$, i.e., an unweighted graph in which the shortest path between any pair of vertices is unique, is there a philogeodetic drawing of $G$, i.e., a drawing of $G$ in which the curves of any two shortest paths meet at most once? We answer this question in the negative by showing the existence of geodetic graphs that require some pair of shortest paths to cross at least four times. The bound on the number of crossings is tight for the class of graphs we construct. Furthermore, we exhibit geodetic graphs of diameter two that do not admit a philogeodetic drawing.

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

↑