Identifying Cluttering Edges in Near-Planar Graphs

dc.contributor.authorWageningen, Simon vanen_US
dc.contributor.authorMchedlidze, Tamaraen_US
dc.contributor.authorTelea, Alexandruen_US
dc.contributor.editorHoellt, Thomasen_US
dc.contributor.editorAigner, Wolfgangen_US
dc.contributor.editorWang, Beien_US
dc.date.accessioned2023-06-10T06:34:45Z
dc.date.available2023-06-10T06:34:45Z
dc.date.issued2023
dc.description.abstractPlanar 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.en_US
dc.description.sectionheadersGraphs and High-Dimensional Data
dc.description.seriesinformationEuroVis 2023 - Short Papers
dc.identifier.doi10.2312/evs.20231048
dc.identifier.isbn978-3-03868-219-6
dc.identifier.pages85-89
dc.identifier.pages5 pages
dc.identifier.urihttps://doi.org/10.2312/evs.20231048
dc.identifier.urihttps://diglib.eg.org:443/handle/10.2312/evs20231048
dc.publisherThe Eurographics Associationen_US
dc.rightsAttribution 4.0 International License
dc.rights.urihttps://creativecommons.org/licenses/by/4.0/
dc.subjectCCS Concepts: Human-centered computing -> Graph drawings
dc.subjectHuman centered computing
dc.subjectGraph drawings
dc.titleIdentifying Cluttering Edges in Near-Planar Graphsen_US
Files
Original bundle
Now showing 1 - 1 of 1
Loading...
Thumbnail Image
Name:
085-089.pdf
Size:
6.66 MB
Format:
Adobe Portable Document Format
Collections