Planar drawings of graphs tend to be favored over non-planar drawings. Testing planarity and creating a planar layout of a planar graph can be done in linear time. However, creating readable drawings of nearly planar graphs remains a challenge. We therefore seek to answer which edges of nearly planar graphs create clutter in their drawings generated by mainstream graph drawing algorithms. We present a heuristic to identify problematic edges in nearly planar graphs and adjust their weights in order to produce higher quality layouts with spring-based drawing algorithms. Our experiments show that our heuristic produces significantly higher quality drawings for augmented grid graphs, augmented triangulations, and deep triangulations.
翻译:图表的平面绘制往往优于非平面绘制。测试平面性并创建平面图的布局可以在线性时间内完成。然而,创建几乎平面图的易读绘制仍然是一项挑战。因此,我们寻求回答几乎平面图中哪些边在通过主流图形绘制算法生成的绘图中产生杂乱,并调整它们的权重以产生具有基于弹簧的绘图算法的更高质量的布局。我们的实验表明,我们的启发式方法为增强网格图,增强三角形图和深度三角形图产生了显着更高质量的绘图。