Are Crossings Important for Drawing Large Graphs?
From MaRDI portal
Publication:2936930
DOI10.1007/978-3-662-45803-7_20zbMath1426.68219OpenAlexW1913975410MaRDI QIDQ2936930
Bahador Saket, Stephen G. Kobourov, Sergey Pupyrev
Publication date: 7 January 2015
Published in: Progress in Pattern Recognition, Image Analysis, Computer Vision, and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-662-45803-7_20
Related Items
Crossing Numbers of Beyond-Planar Graphs Revisited ⋮ Crossing edge minimization in radial outerplanar layered graphs using segment paths ⋮ A quality metric for visualization of clusters in graphs ⋮ Multi-level graph drawing using infomap clustering ⋮ An Experimental Study on the Ply Number of Straight-Line Drawings ⋮ An Experimental Study on the Ply Number of Straight-line Drawings ⋮ MLSEB: Edge Bundling Using Moving Least Squares Approximation ⋮ Drawing Dynamic Graphs Without Timeslices ⋮ Crossing numbers and stress of random graphs ⋮ Visual Similarity Perception of Directed Acyclic Graphs: A Study on Influencing Factors and Similarity Judgment Strategies