Wageningen, Simon vanMchedlidze, TamaraTelea, AlexandruHoellt, ThomasAigner, WolfgangWang, Bei2023-06-102023-06-102023978-3-03868-219-6https://doi.org/10.2312/evs.20231048https://diglib.eg.org:443/handle/10.2312/evs20231048Planar 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.Attribution 4.0 International LicenseCCS Concepts: Human-centered computing -> Graph drawingsHuman centered computingGraph drawings10.2312/evs.2023104885-895 pages