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.

翻译：相较于非平面图绘制，平面图绘制通常更受青睐。平面性测试及平面图的平面布局可在线性时间内完成。然而，如何生成近平面图的可读性绘制仍是一项挑战。因此，我们试图回答：在主流图绘制算法生成的近平面图绘制中，哪些边造成了视觉杂乱？我们提出一种启发式方法，用于识别近平面图中的问题边，并调整其权重，从而借助基于弹簧的绘制算法生成更高质量的布局。实验表明，我们的启发式方法在增强网格图、增强三角剖分图及深度三角剖分图上显著提升了绘制质量。